OpenAlex
PricingAboutJobs
Log inGet started
Work

Approximating maximum independent sets by excluding subgraphs

HTML

Year: 1992
Type: article
Source: BIT Numerical Mathematics
DOI: 10.1007/bf01994876
Authors: Ravi Boppana, Magnús M. Halldórsson
Institutions: Japan Advanced Institute of Science and Technology, New York University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: maximum independent set, approximation algorithms, graph coloring, clique problem, vertex cover, performance guarantees, simultaneous approximation, NP-hard problems

Open Access status: closed
OpenAlex ID: W2089247135
FWCI: 8.462
Cites: 19
Cited by: 402
Related to: 9
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