Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.
Petr A. GolovachPinar HeggernesMamadou Moustapha KantéDieter KratschSigve Hortemo SætherYngve VillangerPublished in: ISAAC (2015)
Keyphrases
- bounded degree
- polynomial delay
- graph mining
- search space
- graph theoretic
- series parallel
- directed graph
- discriminant analysis
- social networks
- graph theory
- graph matching
- structured data
- lower bound
- neural network
- weighted graph
- variable selection
- input variables
- graph partitioning
- graph representation
- input data
- graph construction
- search algorithm