Problems remaining NP-complette for sparse or dense graphs

DOI10.7151/DMGT.1004zbMATH Open0829.05042OpenAlexW2054643041MaRDI QIDQ4846683FDOQ4846683

Ingo Schiermeyer

Publication date: 8 November 1995

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1004

zbMATH Keywords

computational complexityHamiltonian pathNP-completenessindependent setNP-completeHamiltonian circuit

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Eulerian and Hamiltonian graphs (05C45)

Cited In (7)

• ``Global graph problems tend to be intractable
• Going Far from Degeneracy
• Title not available (Why is that?)
• Maximum independent sets near the upper bound
• Fine-grained complexity for sparse graphs
• Improved approximation for spanning star forest in dense graphs
• Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy

This page was built for publication: Problems remaining NP-complette for sparse or dense graphs

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