Pages that link to "Item:Q2872084"
From MaRDI portal
The following pages link to Hardness and Algorithms for Variants of Line Graphs of Directed Graphs (Q2872084):
Displaying 4 items.
- A note on line digraphs and the directed max-cut problem (Q1174433) (← links)
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs (Q1751184) (← links)
- Bounds on directed star arboricity in some digraph classes (Q2413182) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465880) (← links)