Pages that link to "Item:Q5458576"
From MaRDI portal
The following pages link to Domination in Geometric Intersection Graphs (Q5458576):
Displaying 14 items.
- Approximation algorithms for intersection graphs (Q476425) (← links)
- On pseudo-disk hypergraphs (Q827317) (← links)
- The complexity of dominating set in geometric intersection graphs (Q1737591) (← links)
- Dominating set of rectangles intersecting a straight line (Q2025079) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- Minimum vertex cover in ball graphs through local search (Q2250102) (← links)
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783) (← links)
- New geometric representations and domination problems on tolerance and multitolerance graphs. (Q2955008) (← links)
- Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (Q5005138) (← links)
- Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
- A survey on variant domination problems in geometric intersection graphs (Q6536206) (← links)
- The algorithm and complexity of co-secure domination in geometric intersection graphs (Q6653927) (← links)
