Distance-d Independent Set Problems for Bipartite and Chordal Graphs

DOI10.1007/978-3-642-31770-5_21zbMath1301.68135OpenAlexW1811247372MaRDI QIDQ3167365

Hiroshi Eto, Fengrui Guo, Eiji Miyano

Publication date: 2 November 2012

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31770-5_21

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Explore and repair graphs with black holes using mobile entities ⋮ Distance-\(d\) independent set problems for bipartite and chordal graphs

This page was built for publication: Distance-d Independent Set Problems for Bipartite and Chordal Graphs