The maximum independent set problem for cubic planar graphs
From MaRDI portal
Publication:3834072
DOI10.1002/NET.3230190307zbMATH Open0678.05024OpenAlexW2041561514MaRDI QIDQ3834072FDOQ3834072
Authors: James E. Burns 
Publication date: 1989
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230190307
Recommendations
- An approximation algorithm for the maximum independent set problem in cubic planar graphs
- Independent sets in triangle-free cubic planar graphs
- scientific article; zbMATH DE number 3881891
- Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs
- scientific article; zbMATH DE number 1933049
Cites Work
Cited In (14)
- The maximal f-dependent set problem for planar graphs is in NC
- The maximum clique problem
- Approximation algorithm for the distance-3 independent set problem on cubic graphs
- Classes of subcubic planar graphs for which the independent set problem is polynomially solvable
- On the complexity of the independent set problem in triangle graphs
- An approximation algorithm for the maximum independent set problem in cubic planar graphs
- Facets for node packing
- The maximum independent set problem in subclasses of subcubic graphs
- Solving the anti-covering location problem using Lagrangian relaxation
- Title not available (Why is that?)
- On independent domination in planar cubic graphs
- On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs
- Independent sets in triangle-free cubic planar graphs
- The maximal \(f\)-dependent set problem for planar graphs is in NC
This page was built for publication: The maximum independent set problem for cubic planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3834072)
