Minor-closed graph classes with bounded layered pathwidth.
Vida DujmovicDavid EppsteinGwenaël JoretPat MorinDavid R. WoodPublished in: CoRR (2018)
Keyphrases
- bounded treewidth
- bounded degree
- np complete
- equivalence classes
- graph theoretic
- graph theory
- graph representation
- graph model
- bipartite graph
- boolean functions
- directed graph
- neural network
- graph structure
- integrity constraints
- random walk
- fully connected
- graph based algorithm
- graph matching
- graph mining
- structured data
- queueing networks
- multi class
- random graphs
- knn
- bayesian networks