scientific article; zbMATH DE number 6783458
From MaRDI portal
Publication:5365106
zbMath1377.68275MaRDI QIDQ5365106
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133123
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (19)
Finding a Maximum Clique in a Grounded 1-Bend String Graph ⋮ On approximating MIS over B1-VPG graphs* ⋮ Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs ⋮ The clique problem in ray intersection graphs ⋮ Geometric Packing under Nonuniform Constraints ⋮ On streaming algorithms for geometric independent set and clique ⋮ Approximation algorithms for maximum independent set of pseudo-disks ⋮ Many disjoint edges in topological graphs ⋮ Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking ⋮ An algorithm for the maximum weight independent set problem on outerstring graphs ⋮ Many disjoint edges in topological graphs ⋮ Unnamed Item ⋮ Optimality program in segment and string graphs ⋮ Disjoint edges in complete topological graphs ⋮ Planar point sets determine many pairwise crossing segments ⋮ Computing maximum independent set on outerstring graphs and their relatives ⋮ Unnamed Item ⋮ Subexponential algorithms for variants of the homomorphism problem in string graphs ⋮ On the chromatic number of disjointness graphs of curves
This page was built for publication:
