The following pages link to (Q4535037):
Displayed 8 items.
- Efficient enumeration of all ladder lotteries and its application (Q964388) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- On approximating the \(d\)-girth of a graph (Q2444552) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) (Q3605493) (← links)
- Generating All Triangulations of Plane Graphs (Extended Abstract) (Q3605494) (← links)
- Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
- Listing All Plane Graphs (Q5452167) (← links)