Polynomial-Time Algorithm for the Leafage of Chordal Graphs.
Michel HabibJuraj StachoPublished in: ESA (2009)
Keyphrases
- computational complexity
- np hard
- preprocessing
- learning algorithm
- graph isomorphism
- optimal solution
- detection algorithm
- k means
- special case
- computational cost
- worst case
- expectation maximization
- np complete
- objective function
- neural network
- segmentation algorithm
- optimization algorithm
- lower bound
- matching algorithm
- convergence rate
- graph matching
- graph structure
- undirected graph
- subgraph isomorphism
- polynomial time complexity