Pages that link to "Item:Q3034824"
From MaRDI portal
The following pages link to Computing Simple Circuits from a Set of Line Segments is NP-Complete (Q3034824):
Displaying 21 items.
- Computing simple circuits from a set of line segments (Q583232) (← links)
- Connectivity augmentation in planar straight line graphs (Q661949) (← links)
- Pointed binary encompassing trees: simple and optimal (Q733553) (← links)
- Compatible geometric matchings (Q924079) (← links)
- Augmenting the connectivity of geometric graphs (Q929747) (← links)
- Alternating paths through disjoint line segments (Q1014442) (← links)
- Hamiltonian triangulations and circumscribing polygons of disjoint line segments (Q1200910) (← links)
- On a counterexample to a conjecture of Mirzaian (Q1200912) (← links)
- Segment endpoint visibility graphs are Hamiltonian (Q1395575) (← links)
- The visibility graph of congruent discs is Hamiltonian (Q1873692) (← links)
- On \(k\)-convex point sets (Q2248736) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- Compatible spanning trees (Q2444309) (← links)
- Angle-restricted tours in the plane. (Q2482907) (← links)
- Circumscribing polygons and polygonizations for disjoint line segments (Q2671176) (← links)
- Reconstruction of Weakly Simple Polygons from Their Edges (Q3177902) (← links)
- Augmenting Geometric Graphs with Matchings (Q5014140) (← links)
- (Q5088936) (← links)
- Augmenting the Connectivity of Planar and Geometric Graphs (Q5300981) (← links)
- On the visibility graph of convex translates (Q5951963) (← links)
- On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane (Q5951972) (← links)
