An upper bound on the independence number of a graph computable in polynomial-time

From MaRDI portal
Publication:1919180

DOI10.1016/0167-6377(95)00042-9zbMath0855.90134OpenAlexW2052426325WikidataQ127363278 ScholiaQ127363278MaRDI QIDQ1919180

Carlos J. Luz

Publication date: 11 February 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(95)00042-9




Related Items (14)



Cites Work


This page was built for publication: An upper bound on the independence number of a graph computable in polynomial-time