The following pages link to Packing directed cycles efficiently (Q867851):
Displaying 12 items.
- Packing cycles exactly in polynomial time (Q421271) (← links)
- Packing edge-disjoint triangles in regular and almost regular tournaments (Q472970) (← links)
- Packing directed circuits exactly (Q663091) (← links)
- Directed cut transversal packing for source-sink connected graphs (Q1101126) (← links)
- On integrality, stability and composition of dicycle packings and covers (Q1583704) (← links)
- Packing directed circuits fractionally (Q1894706) (← links)
- Packing and covering directed triangles asymptotically (Q2065998) (← links)
- Packing cycles through prescribed vertices (Q2275896) (← links)
- Packing triangles in regular tournaments (Q2852611) (← links)
- How to Pack Directed Acyclic Graphs into Small Blocks (Q3434563) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311107) (← links)
- Packing and Covering a Given Directed Graph in a Directed Graph (Q6146269) (← links)