A note on maximum independent set and related problems on box graphs

DOI10.1016/j.ipl.2004.10.013zbMath1173.68887OpenAlexW2023960977MaRDI QIDQ835020

Andrzej Lingas, Martin Wahlen

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.10.013

zbMATH Keywords

complexityalgorithmsanalysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cites Work

• Finding small simple cycle separators for 2-connected planar graphs
• Unnamed Item