Boundary classes for the list-ranking problems in the case of forests

MaRDI QIDQ3115286zbMATH OpenFDO

Authors D. S. Malyshev, V. E. Alekseev

Publication date 20 February 2012

zbMATH Keywords

computational complexityforestboundary classlist-ranking problemrelative boundary class

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Minimal hard classes of graphs for the edge list-ranking problem
• On minimal complex classes of graphs
• The complexity analysis of the edge-ranking problem for hereditary graph classes with at most three prohibitions
• Classes of graphs critical for the edge list-ranking problem
• scientific article; zbMATH DE number 5844196

Cited in

(4)

• Minimal hard classes of graphs for the edge list-ranking problem
• On minimal complex classes of graphs
• Classes of graphs critical for the edge list-ranking problem
• The complexity analysis of the edge-ranking problem for hereditary graph classes with at most three prohibitions

This page was built for publication: Boundary classes for the list-ranking problems in the case of forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115286)