Relating Graph Thickness to Planar Layers and Bend Complexity.
Stephane DurocherDebajyoti MondalPublished in: CoRR (2016)
Keyphrases
- random walk
- decision problems
- graph theoretic
- polynomial time complexity
- worst case
- connected components
- computational complexity
- planar graphs
- data sets
- directed graph
- bounded treewidth
- dependency graph
- random graphs
- graph model
- graph mining
- graph structure
- graph theory
- complex networks
- structured data
- np complete
- lower bound
- social networks