Pages that link to "Item:Q1862130"
From MaRDI portal
The following pages link to An efficient algorithm for enumeration of triangulations (Q1862130):
Displaying 13 items.
- Flips in planar graphs (Q950400) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- Enumerating pseudo-triangulations in the plane (Q1776895) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- Enumerating non-crossing minimally rigid frameworks (Q2373440) (← links)
- Counting Plane Graphs with Exponential Speed-Up (Q3003469) (← links)
- Generating All Triangulations of Plane Graphs (Extended Abstract) (Q3605494) (← 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)
