Pages that link to "Item:Q5745385"
From MaRDI portal
The following pages link to Counting and enumerating crossing-free geometric graphs (Q5745385):
Displaying 15 items.
- On crossing numbers of geometric proximity graphs (Q632725) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Counting the number of crossings in geometric graphs (Q2224846) (← links)
- Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- On crossing families of complete geometric graphs (Q2416466) (← links)
- Counting crossing-free structures (Q2874565) (← links)
- Reporting the crossing-free segments of a complete geometric graph (Q4332449) (← links)
- Counting Plane Graphs: Cross-Graph Charging Schemes (Q4912187) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
- (Q5088963) (← links)
- Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)
- Non-crossing Hamiltonian paths and cycles in output-polynomial time (Q6614115) (← links)