Hyperbolic intersection graphs and (quasi)-polynomial time.
Sándor Kisfaludi-BakPublished in: SODA (2020)
Keyphrases
- graph isomorphism
- bounded treewidth
- polynomial time complexity
- special case
- planar graphs
- graph theoretic
- graph matching
- graph structure
- graph representation
- graph mining
- graph theory
- approximation algorithms
- social network analysis
- random graphs
- worst case
- computational complexity
- conservation laws
- neural network
- subgraph isomorphism
- traffic light
- graph partitioning
- graph model
- np complete