OpenAlex
PricingAboutJobs
Log inGet started
Work

Measure and conquer: a simple O(20.288n) independent set algorithm

HTML

Year: 2006
Type: conference-paper
Source: Symposium on Discrete Algorithms
DOI: 10.5555/1109557.1109560
Authors: Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
Institutions: University of Bergen, Sapienza University of Rome, Université Paul Verlaine - Metz
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: measure and conquer, maximum independent set, exact exponential algorithms, backtracking, branching algorithms, NP-hard problems

Open Access status: closed
OpenAlex ID: W2099474653
FWCI: 15.84
Cites: 22
Cited by: 114
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms