Antisymmetrical Digraphs
From MaRDI portal
Publication:5543330
Cited in
(11)- On flows in simple bidirected and skew-symmetric networks
- The factorization of graphs. II
- Minimum mean cycle problem in bidirected and skew-symmetric graphs
- Maximum matching in almost linear time on graphs of bounded clique-width
- Free multiflows in bidirected and skew-symmetric graphs
- Path problems in skew-symmetric graphs
- Balanced network flows. IV: Duality and structure theory.
- Making bidirected graphs strongly connected
- Min-cost multiflows in node-capacitated undirected networks
- scientific article; zbMATH DE number 1769330 (Why is no real title available?)
- Faster graph bipartization
This page was built for publication: Antisymmetrical Digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5543330)