Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.
Petr A. GolovachPinar HeggernesMamadou Moustapha KantéDieter KratschSigve Hortemo SætherYngve VillangerPublished in: CoRR (2015)
Keyphrases
- graph mining
- polynomial delay
- bounded degree
- graph theoretic
- discriminant analysis
- graph databases
- graph theory
- graph matching
- bounded treewidth
- graph model
- low dimensional
- weighted graph
- input variables
- neural network
- graph representation
- random graphs
- low order
- series parallel
- fixed parameter tractable
- bayesian networks