Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs.
Dieter KratschRoss M. McConnellKurt MehlhornJeremy P. SpinradPublished in: SIAM J. Comput. (2006)
Keyphrases
- graph theory
- computational complexity
- graph construction
- max cut
- orders of magnitude
- optimization problems
- computational cost
- graph isomorphism
- worst case
- np hard
- graph matching
- random graphs
- graph representation
- real world graphs
- graph structures
- dynamic graph
- learning algorithm
- significant improvement
- graph structure
- graph model
- maximal cliques
- maximum cardinality
- genetic algorithm
- objective function
- computationally efficient
- graph properties
- representational power
- series parallel
- graph embedding
- shortest path
- weighted graph
- edge weights
- graph theoretic
- graph mining
- graph databases