Pages that link to "Item:Q3719850"
From MaRDI portal
The following pages link to Efficient Algorithms for Geometric Graph Search Problems (Q3719850):
Displayed 10 items.
- Minimum k-partitioning of rectilinear polygons (Q912618) (← links)
- Labeling points with given rectangles (Q1029061) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles (Q1196367) (← links)
- Schematization of networks (Q1776896) (← links)
- A practical map labeling algorithm. (Q2482896) (← links)
- Linear time algorithms for graph search and connectivity determination on complement graphs. (Q2583566) (← links)
- Quadrilaterizing an Orthogonal Polygon in Parallel (Q4379627) (← links)
- PARTITIONING 3D PHANTOMS INTO HOMOGENEOUS CUBOIDS (Q5696945) (← links)
- On a minimum linear classification problem (Q5920647) (← links)