Solving problems on special classes of graphs

MaRDI QIDQ2816133zbMATH OpenFDO

Authors Vijay Raghavan, Jeremy P. Spinrad

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065305801829?np=y

zbMATH Keywords

NP-completenesswell-covered graphrobust algorithmunit disk graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Robust algorithms for restricted domains
• Robust algorithms for the stable set problem
• scientific article; zbMATH DE number 1839471
• Unit disk graphs
• Colouring Some Classes of Perfect Graphs Robustly

Cited in

(6)

• Solving a special case of the P conjecture using dependency graphs with dissolution
• scientific article; zbMATH DE number 3235079 (Why is no real title available?)
• Co-bipartite neighborhood edge elimination orderings
• scientific article; zbMATH DE number 992954 (Why is no real title available?)
• Classification problem for graphs and lattices is wild.
• Robust algorithms for restricted domains

This page was built for publication: Solving problems on special classes of graphs

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