Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs

DOI10.1007/3-540-45071-8_7zbMath1276.05117OpenAlexW1761251274MaRDI QIDQ3082912

Martin Wahlen, Andrzej Lingas

Publication date: 18 March 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45071-8_7

zbMATH Keywords

maximum independent setminimum vertex coverbox graphmaximum induced subgraphorthogonal rectangles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs