Classifies the classical and parameterized complexity of vertex-identification problems to chordal graph subclasses, with an almost complete picture for parameters k and n-k.
Bin packing with fixed number of bins revisited.J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Identification to Subclasses of Chordal Graphs
Classifies the classical and parameterized complexity of vertex-identification problems to chordal graph subclasses, with an almost complete picture for parameters k and n-k.