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

AuthID
 P-001-G8Y
1
Author(s)
Tipo de Documento
Article
Year published
1995
Publicado
in OPERATIONS RESEARCH LETTERS, ISSN: 0167-6377
Volume: 18, Número: 3, Páginas: 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
Lista Marked
 Adicionar à lista Marked
Info
At this moment we don't have any links to full text documens.

Um espaço para investigadores e suas Instituições

Links Úteis

Ajuda

© 2024 CRACS & Inesc TEC - All Rights Reserved Política de Privacidade | Terms of Service