scientific article; zbMATH DE number 1146228
From MaRDI portal
Publication:4386300
zbMath0974.05039MaRDI QIDQ4386300
Publication date: 25 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
mixed graphstrongly connected orientationcrossing submodular functionsfeasibility theorem for submodular flows
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (12)
Increasing digraph arc-connectivity by arc addition, reversal and complement ⋮ Base polyhedra and the linking property ⋮ Combined connectivity augmentation and orientation problems ⋮ Approximating Minimum Cost Connectivity Orientation and Augmentation ⋮ A Survey on Covering Supermodular Functions ⋮ Graph orientations with set connectivity requirements ⋮ Tree-compositions and orientations ⋮ Recent results on well-balanced orientations ⋮ Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs ⋮ An orientation theorem with parity conditions ⋮ The edge-orientation problem and some of its variants on weighted graphs ⋮ On the \(k\)-orientability of random graphs
This page was built for publication:
