An algorithm for finding a large independent set in planar graphs

DOI10.1002/NET.3230130209zbMATH Open0507.68040OpenAlexW1978360119MaRDI QIDQ4745274FDOQ4745274

Nobuji Saito, Norishige Chiba, Takao Nishizeki

Publication date: 1983

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230130209

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Efficient Planarity Testing

Cited In (2)

• The maximum clique problem
• Graph theory (algorithmic, algebraic, and metric problems)

This page was built for publication: An algorithm for finding a large independent set in planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4745274)