z-logo
open-access-imgOpen Access
Maximum independent set for intervals by divide and conquer with pruning
Author(s) -
Jack Snoeyink
Publication year - 2007
Publication title -
carolina digital repository (university of north carolina at chapel hill)
Language(s) - English
DOI - 10.17615/4548-7q54
Subject(s) - divide and conquer algorithms , pruning , set (abstract data type) , computer science , mathematics , extension (predicate logic) , statistics , algorithm , horticulture , biology , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom