An approximation algorithm for the maximum independent set problem in cubic planar graphs
From MaRDI portal
Publication:3787812
DOI10.1002/net.3230160402zbMath0644.90093OpenAlexW2158991247MaRDI QIDQ3787812
Elarbi Choukhmane, John V. Franco
Publication date: 1986
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230160402
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)
Related Items
Cites Work