Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
- 13 February 2017
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 80 (2) , 714-741
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- European Research Council (267959)
- Agence Nationale de la Recherche (ANR-15-CE-0009, ANR-15-CE-0009)
This publication has 24 references indexed in Scilit:
- Graph classes with structured neighborhoods and algorithmic applicationsTheoretical Computer Science, 2013
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problemsTheoretical Computer Science, 2013
- Linear delay enumeration and monadic second-order logicDiscrete Applied Mathematics, 2009
- On the Cubicity of Interval GraphsGraphs and Combinatorics, 2009
- The Bidimensional Theory of Bounded-Genus GraphsSIAM Journal on Discrete Mathematics, 2006
- Bidimensional Parameters and Local TreewidthSIAM Journal on Discrete Mathematics, 2004
- Hypergraph Transversal Computation and Related Problems in Logic and AILecture Notes in Computer Science, 2002
- Graph Classes: A Survey1999
- Reverse search for enumerationDiscrete Applied Mathematics, 1996
- Identifying the Minimal Transversals of a Hypergraph and Related ProblemsSIAM Journal on Computing, 1995