On dominating set of some subclasses of string graphs
From MaRDI portal
Recommendations
- Approximating domination on intersection graphs of paths on a grid
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
- Approximating dominating set on intersection graphs of rectangles and L-frames
- scientific article; zbMATH DE number 1522922
- scientific article; zbMATH DE number 975351
Cites work
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- A (2+ε)-Approximation Scheme for Minimum Domination on Circle Graphs
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- APX-hardness of domination problems in circle graphs
- Algorithms for dominating set in disk graphs: breaking the \(\log n\) barrier (extended abstract)
- An algorithm for the maximum weight independent set problem on outerstring graphs
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
- Approximating domination on intersection graphs of paths on a grid
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve
- Approximating minimum dominating set on string graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Approximation and Online Algorithms
- Approximation hardness of dominating set problems in bounded degree graphs
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Coloring curves that cross a fixed curve
- Computational geometry. Algorithms and applications.
- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
- Covering, hitting, piercing and packing rectangles intersecting an inclined line
- Dominating set on overlap graphs of rectangles intersecting a line
- Domination in Geometric Intersection Graphs
- Domination in permutation graphs
- Effectiveness of local search for art gallery problems
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
- Intersection graphs of L-shapes and segments in the plane
- Intersection graphs of curves in the plane
- Max point-tolerance graphs
- Minimum dominating set problem for unit disks revisited
- Minimum vertex cover in rectangle graphs
- On bounding the chromatic number of L-graphs
- Optimality program in segment and string graphs
- Optimization problems in multiple-interval graphs
- Orthogonal segment stabbing
- Packing and covering with non-piercing regions
- Parameterized Domination in Circle Graphs
- Permutation graphs: Connected domination and Steiner trees
- Simple heuristics for unit disk graphs
- String graphs. II: Recognizing string graphs is NP-hard
- The complexity of dominating set in geometric intersection graphs
- Topology of Thin Film RC Circuits
- Unit disk graphs
- Vertex Intersection Graphs of Paths on a Grid
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
Cited in
(5)- Layered graphs: applications and algorithms
- Approximating domination on intersection graphs of paths on a grid
- Recognizing geometric intersection graphs stabbed by a line
- Approximating dominating set on intersection graphs of rectangles and L-frames
- A survey on variant domination problems in geometric intersection graphs
This page was built for publication: On dominating set of some subclasses of string graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144448)
