scientific article; zbMATH DE number 867674
From MaRDI portal
Publication:4873786
Recommendations
Cited in
(6)- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
- Independent set of intersection graphs of convex objects in 2D
- Admission control with advance reservations in simple networks
- Minimum vertex cover in rectangle graphs
- Strong pseudo transitivity and intersection graphs
- Maximum independent set and maximum clique algorithms for overlap 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 Q4873786)