A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation

From MaRDI portal
Publication:3095042

DOI10.1051/ita/2011106zbMath1228.05224OpenAlexW2090708733MaRDI QIDQ3095042

T. O. Ferreira, Márcia R. Cerioli, Fábio Protti, Luérbio Faria

Publication date: 28 October 2011

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2011__45_3_331_0/




Related Items (8)



Cites Work


This page was built for publication: A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation