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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Networks Ročník 49; číslo 2; s. 158 - 159
Hlavný autor:	Snoeyink, Jack
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.03.2007 John Wiley & Sons
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!