Classes of graphs with small rank decompositions are X-bounded.

Zdenek Dvorák Daniel Král'

Published in: Eur. J. Comb. (2012)

Keyphrases

bounded degree
small number
graph theoretic
singular value decomposition
graph matching
database
decision trees
query language
directed graph
graph databases
graph partitioning
class hierarchy