Maximum independent set for intervals by divide and conquer with pruning

Suppose a given set of n intervals contains a maximum independent set of k disjoint intervals. This brief note demonstrates that “divide and conquer with pruning” produces an easy, output‐sensitive O(n log k)‐time algorithm to compute such a maximum independent set. © 2006 Wiley Periodicals, Inc. NE...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Networks Jg. 49; H. 2; S. 158 - 159
1. Verfasser:	Snoeyink, Jack
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.03.2007 John Wiley & Sons
Schlagworte:	Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface divide and conquer Exact sciences and technology interval graph maximum independent set output-sensitive algorithm Software Interval graph Filtering Independent set Pruning(tree) divide and conquer maximum independent set Divide and conquer method output- sensitive algorithm
ISSN:	0028-3045, 1097-0037
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!