scientific article
From MaRDI portal
Publication:3933762
zbMath0477.68069MaRDI QIDQ3933762
Nobuji Saito, Norishige Chiba, Takao Nishizeki
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
planar graphsapproximation algorithmsmaximum matching problemminimum vertex cover problemmaximum induced subgraph problems
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (8)
A graph approximation heuristic for the vertex cover problem on planar graphs ⋮ How to catch marathon cheaters: new approximation algorithms for tracking paths ⋮ Theory and application of width bounded geometric separators ⋮ \(N\)-separators in planar graphs ⋮ Structure of polynomial-time approximation ⋮ Minimum vertex cover in rectangle graphs ⋮ On approximation problems related to the independent set and vertex cover problems ⋮ Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
This page was built for publication:
