scientific article
From MaRDI portal
Publication:3115202
zbMath1249.05368MaRDI QIDQ3115202
Publication date: 20 February 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityboundary classlist-ranking problemminimal hard classrecognition of hereditary property
Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
On integer programming with bounded determinants ⋮ The width and integer optimization on simplices with bounded minors of the constraint matrices ⋮ Critical hereditary graph classes: a survey ⋮ Boundary properties of graphs for algorithmic graph problems ⋮ Critical elements in combinatorially closed families of graph classes ⋮ A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs
This page was built for publication:
