Pages that link to "Item:Q2492638"
From MaRDI portal
The following pages link to An efficient algorithm for finding maximum cycle packings in reducible flow graphs (Q2492638):
Displaying 6 items.
- Packing feedback arc sets in reducible flow graphs (Q326500) (← links)
- Solving problems for maximal reducible flowgraphs. (Q1427189) (← links)
- A \(\min\)-\(\max\) relation in flowgraphs and some applications (Q1752483) (← links)
- On ideal semicomplete digraphs (Q2296276) (← links)
- Solving problems for maximal reducible flowgraphs (Q2816047) (← links)
- Algorithms and Computation (Q5712121) (← links)