An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs
From MaRDI portal
Publication:3612594
DOI10.1007/978-3-540-73814-5_27zbMath1214.05164OpenAlexW1613178797MaRDI QIDQ3612594
Stavros D. Nikolopoulos, Leonidas Palios
Publication date: 10 March 2009
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73814-5_27
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A simple certifying algorithm for 3-edge-connectivity, Certifying algorithms, An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs, An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs