Pages that link to "Item:Q909681"
From MaRDI portal
The following pages link to The number of depth-first searches of an ordered set (Q909681):
Displaying 7 items.
- Planar posets, dimension, breadth and the number of minimal elements (Q304190) (← links)
- NP-completeness properties about linear extensions (Q581427) (← links)
- NP-completeness results concerning greedy and super greedy linear extensions (Q1087567) (← links)
- Counting linear extensions (Q1183942) (← links)
- A linear algorithm to decompose inheritance graphs into modules (Q1892582) (← links)
- Greedy balanced pairs in \(N\)-free ordered sets (Q2217505) (← links)
- Depth-First Search Using $$O(n)$$ Bits (Q2942660) (← links)