Two tricks to triangulate chordal probe graphs in polynomial time.
Anne BerryMartin Charles GolumbicMarina LipshteynPublished in: SODA (2004)
Keyphrases
- graph isomorphism
- undirected graph
- polynomial time complexity
- approximation algorithms
- bounded treewidth
- special case
- graph matching
- computational complexity
- planar graphs
- graph theoretic
- graph representation
- graph theory
- weighted graph
- graph structure
- np complete
- worst case
- neural network
- graph databases
- graph mining
- complex structures
- data sets
- pairwise