Pages that link to "Item:Q1862130"
From MaRDI portal
The following pages link to An efficient algorithm for enumeration of triangulations (Q1862130):
Displaying 10 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)
- (Q5088963) (← links)
