A completely dynamic algorithm for split graphs.
Federico ManciniPinar HeggernesPublished in: Electron. Notes Discret. Math. (2006)
Keyphrases
- learning algorithm
- high accuracy
- dynamic programming
- computational complexity
- detection algorithm
- worst case
- search space
- times faster
- cost function
- theoretical analysis
- experimental evaluation
- computationally efficient
- graph isomorphism
- neural network
- significant improvement
- optimal solution
- objective function
- segmentation algorithm
- tree structure
- matching algorithm
- k means
- maximum common subgraph
- expectation maximization
- optimization algorithm
- np hard
- improved algorithm