Publication:3115202
From MaRDI portal
zbMath1249.05368MaRDI QIDQ3115202
Publication date: 20 February 2012
computational complexity; boundary class; list-ranking problem; minimal hard class; recognition of hereditary property
68P10: Searching and sorting
68R10: Graph theory (including graph drawing) in computer science
05C75: Structural characterization of families of graphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Critical elements in combinatorially closed families of graph classes, A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs, 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