On Edge-Independent Sets

DOI10.1007/978-3-642-38756-2_28zbMath1303.05140OpenAlexW63807318WikidataQ62041770 ScholiaQ62041770MaRDI QIDQ5405939

Ching-Hao Liu, Ton Kloks, Sheung-Hung Poon

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_28

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (1)

A survey of the studies on Gallai and anti-Gallai graphs

This page was built for publication: On Edge-Independent Sets