Solving problems on special classes of graphs

zbMATH Open1412.05190MaRDI QIDQ2816133

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)

Cited In (4)

• Solving a special case of the P conjecture using dependency graphs with dissolution
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classification problem for graphs and lattices is wild.

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)