scientific article; zbMATH DE number 3881891

MaRDI QIDQ3216150zbMATH OpenFDO

Authors C. E. Veni Madhavan

Publication date 1984

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An approximation algorithm for the maximum independent set problem in cubic planar graphs
• Large independent sets in triangle-free planar graphs
• Large independent sets in triangle-free planar graphs
• Independent sets in triangle-free cubic planar graphs
• Triangle-free planar graphs with small independence number

Cited in

(18)

• Real and integer domination in graphs
• Triangle-free planar graphs with small independence number
• A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs
• Approximation algorithms for independent sets in map graphs
• Large independent sets in triangle-free planar graphs
• Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs
• Optimal space coverage with white convex polygons
• White space regions
• Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
• An approximation algorithm for the maximum independent set problem in cubic planar graphs
• The maximum independent set problem for cubic planar graphs
• Large independent sets in triangle-free planar graphs
• Approximation algorithms for maximum independent set of pseudo-disks
• A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
• The maximal f-dependent set problem for planar graphs is in NC
• On the d-independence number in 1-planar graphs
• On the independence number of 1-planar graphs
• An optimal maximal independent set algorithm for bounded-independence graphs

This page was built for publication:

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