An Upper Bound on the Independence Number of a Graph Computable in Polynomial-Time

AuthID
 P-001-G8Y
1
Author(s)
Document Type
Article
Year published
1995
Published
in OPERATIONS RESEARCH LETTERS, ISSN: 0167-6377
Volume: 18, Issue: 3, Pages: 139-145 (7)
Indexing
Wos®
Scopus®
Crossref®
Google Scholar®
Publication Identifiers
Scopus: 2-s2.0-0042769653
Wos: WOS:A1995TL78600006
Source Identifiers
ISSN: 0167-6377
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

footer slogan

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service