Hyperbolic intersection graphs and (quasi)-polynomial time.
Sándor Kisfaludi-BakPublished in: CoRR (2018)
Keyphrases
- bounded treewidth
- graph isomorphism
- planar graphs
- special case
- polynomial time complexity
- worst case
- approximation algorithms
- graph theoretic
- computational complexity
- graph databases
- graph model
- graph theory
- multiscale
- graph structure
- graph clustering
- graph search
- subgraph isomorphism
- partial differential equations
- series parallel
- approximation guarantees
- directed graph
- upper bound
- pattern recognition