Approximation algorithms for independent sets in map graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1696627
- scientific article; zbMATH DE number 1182757
- Approximating independent sets in sparse graphs
- scientific article; zbMATH DE number 3881891
- Approximating independent set in perturbed graphs
- Structural Information and Communication Complexity
- Approximation algorithms for maximum independent set of a unit disk graph
- Efficient independent set approximation in unit disk graphs
- scientific article; zbMATH DE number 927049
- On approximation properties of the independent set problem for low degree graphs
Cited in
(27)- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- Large independent sets in random regular graphs
- Graph separators: A parameterized view
- Planar graphs having no proper 2-immersions in the plane. I
- Efficient independent set approximation in unit disk graphs
- Characterizing 5-map graphs by 2-fan-crossing graphs
- \(K_7\)-minors in optimal 1-planar graphs
- Minimal non-1-planar graphs
- Map graphs having witnesses of large girth
- scientific article; zbMATH DE number 1696627 (Why is no real title available?)
- An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs
- Proper 1-immersions of graphs triangulating the plane
- Orthogonal tree decompositions of graphs
- scientific article; zbMATH DE number 927049 (Why is no real title available?)
- Tree densities in sparse graph classes
- Progressive algorithms for domination and independence
- Decomposition of Map Graphs with Applications.
- Constrained representations of map graphs and half-squares
- Structure of graphs with locally restricted crossings
- scientific article; zbMATH DE number 7053376 (Why is no real title available?)
- scientific article; zbMATH DE number 7651158 (Why is no real title available?)
- Covering and packing of rectilinear subdivision
- All 2-planar graphs having the same spanning subgraph
- Clique-based separators for geometric intersection graphs
- Recognizing map graphs of bounded treewidth
- Clustered coloring of graphs with bounded layered treewidth and bounded degree
This page was built for publication: Approximation algorithms for independent sets in map graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2765954)
