All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time.
Anna AccorneroMassimo AnconaSonia VariniPublished in: Int. J. Found. Comput. Sci. (2000)
Keyphrases
- bounded treewidth
- graph structure
- polynomial time complexity
- random walk
- graph search
- three dimensional
- graph theoretic
- structured data
- directed graph
- graph matching
- graph isomorphism
- bipartite graph
- approximation algorithms
- worst case
- special case
- search algorithm
- massive graphs
- planar graphs
- causal graph
- graph databases
- graph mining
- directed acyclic graph
- graph representation
- graph model
- bounded degree
- computational complexity