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

A unit disk graph is the intersection graph of a family of unit disks in the plane. If the disks do not overlap, it is also a unit coin graph or penny graph. It is known that finding a maximum independent set in a unit disk graph is a NP-hard problem. In this work we extend this result to penny grap...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	RAIRO. Informatique théorique et applications 2011-07, Vol.45 (3), p.331-346
Hauptverfasser:	Cerioli, Marcia R., Faria, Luerbio, Ferreira, Talita O., Protti, Fábio
Format:	Artikel
Sprache:	eng
Schlagworte:	05C69 05C75 68Q25 68W25 Algorithmics. Computability. Computer arithmetics Applied sciences approximation algorithms clique partition Computer science control theory systems Exact sciences and technology independent set Information retrieval. Graph Miscellaneous penny graphs Theoretical computing unit coin graphs Unit disk graphs
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!