A practical heuristic for finding graph minors.
Jun CaiWilliam G. MacreadyAidan RoyPublished in: CoRR (2014)
Keyphrases
- real world
- depth first search
- graph theory
- search algorithm
- maximum clique
- graph search
- random walk
- maximum independent set
- graph representation
- directed acyclic graph
- graph structure
- breadth first search
- strongly connected
- bipartite graph
- graph matching
- search strategies
- spanning tree
- directed graph
- graph theoretic
- constraint satisfaction
- special case
- graph model
- minimum spanning tree
- connected components
- structured data