Classes of graphs critical for the edge list-ranking problem
From MaRDI portal
Publication:5264719
Recommendations
- Minimal hard classes of graphs for the edge list-ranking problem
- The complexity analysis of the edge-ranking problem for hereditary graph classes with at most three prohibitions
- Boundary classes for the list-ranking problems in the case of forests
- On minimal complex classes of graphs
- scientific article; zbMATH DE number 5844196
Cited in
(15)- Edge ranking of graphs is hard
- Critical hereditary graph classes: a survey
- Minimal hard classes of graphs for the edge list-ranking problem
- Critical elements in combinatorially closed families of graph classes
- On König graphs with respect to \(P_4\)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems
- scientific article; zbMATH DE number 7742925 (Why is no real title available?)
- On lattice point counting in \(\varDelta\)-modular polyhedra
- FPT-algorithm for computing the width of a simplex given by a convex hull
- Boundary classes for the list-ranking problems in the case of forests
- On integer programming with bounded determinants
- The width and integer optimization on simplices with bounded minors of the constraint matrices
- Optimal edge ranking of complete bipartite graphs in polynomial time
- A complexity dichotomy and a new boundary class for the dominating set problem
- The complexity analysis of the edge-ranking problem for hereditary graph classes with at most three prohibitions
This page was built for publication: Classes of graphs critical for the edge list-ranking problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264719)
