All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time.
Anna AccorneroMassimo AnconaSonia VariniPublished in: WG (1999)
Keyphrases
- graph representation
- planar graphs
- bounded treewidth
- massive graphs
- polynomial time complexity
- directed graph
- three dimensional
- graph theory
- graph structure
- computational complexity
- special case
- graph mining
- connected components
- structured data
- graph model
- worst case
- random walk
- graph partitioning
- community detection
- social network analysis
- smooth surfaces
- graph search
- causal graph
- graph databases
- graph isomorphism
- weighted graph
- social networks