An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs

DOI10.1007/978-3-642-38756-2_10zbMath1303.05201OpenAlexW2405404538MaRDI QIDQ5405918

Hiroshi Nagamochi, Mingyu Xiao

Publication date: 3 April 2014

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38756-2_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

An exact algorithm for maximum independent set in degree-5 graphs ⋮ An improved exact algorithm for TSP in graphs of maximum degree 4

This page was built for publication: An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs