Embedding and canonizing graphs of bounded genus in logspace.
Michael ElberfeldKen-ichi KawarabayashiPublished in: STOC (2014)
Keyphrases
- graph embedding
- graph matching
- graph theoretic
- bounded treewidth
- complex structures
- series parallel
- graph theory
- graph databases
- information hiding
- graph mining
- graph model
- data sets
- np complete
- graph clustering
- dimensionality reduction
- nonlinear dimensionality reduction
- graph structures
- clustering algorithm
- knowledge base
- social networks