Certifying algorithms for recognizing interval graphs and permutation graphs.
Dieter KratschRoss M. McConnellKurt MehlhornJeremy P. SpinradPublished in: SODA (2003)
Keyphrases
- graph theory
- learning algorithm
- max cut
- polynomial time complexity
- representational power
- theoretical analysis
- graph representation
- maximum clique
- orders of magnitude
- graph embedding
- graph data
- graph isomorphism
- computationally efficient
- optimization problems
- data structure
- maximum cardinality
- planar graphs
- dynamic graph
- maximal cliques
- graph construction
- real world networks
- undirected graph
- graph mining
- graph matching
- directed graph
- data mining techniques
- semi supervised
- scheduling problem
- computational complexity