Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.
Petr A. GolovachPinar HeggernesMamadou Moustapha KantéDieter KratschSigve Hortemo SætherYngve VillangerPublished in: Algorithmica (2018)
Keyphrases
- bounded degree
- graph representation
- graph matching
- maximal cliques
- random graphs
- discriminant analysis
- neural network
- maximal clique enumeration
- polynomial delay
- graph databases
- low dimensional
- dynamic programming
- data sets
- rbf network
- graph mining
- connected components
- graph clustering
- input data
- polynomial size
- search algorithm