Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs
From MaRDI portal
Publication:1816947
DOI10.1016/0024-3795(95)00056-9zbMath0877.15026OpenAlexW2065176843MaRDI QIDQ1816947
Zeev Nutov, Michal Penn, Alberto Borobia
Publication date: 12 November 1997
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(95)00056-9
Related Items (2)
Delta invariant for Eulerian digraphs ⋮ Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized transitive tournaments and doubly stochastic matrices
- On removing a vertex from the assignment polytope
- \((0,{1\over 2},1)\) matrices which are extreme points of the generalized transitive tournament polytope
- On the integral dicycle packings and covers and the linear ordering polytope
- On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope
- Packing circuits in eulerian digraphs
- Results and problems in the theory of doubly-stochastic matrices
- A Minimax Theorem for Directed Graphs
- Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
This page was built for publication: Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs