Classes of graphs critical for the edge list-ranking problem
From MaRDI portal
Publication:5264719
DOI10.1134/S1990478914020112zbMath1324.05163MaRDI QIDQ5264719
Publication date: 27 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
computational complexitypolynomial algorithmhereditary classboundary classminimal hard classedge list-ranking problem
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
On integer programming with bounded determinants ⋮ The width and integer optimization on simplices with bounded minors of the constraint matrices ⋮ A complexity dichotomy and a new boundary class for the dominating set problem ⋮ On lattice point counting in \(\varDelta\)-modular polyhedra ⋮ On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems ⋮ Unnamed Item ⋮ On König graphs with respect to P4 ⋮ Critical hereditary graph classes: a survey ⋮ FPT-algorithm for computing the width of a simplex given by a convex hull ⋮ Critical elements in combinatorially closed families of graph classes
This page was built for publication: Classes of graphs critical for the edge list-ranking problem
