Tree-compositions and orientations

DOI10.1016/j.orl.2013.03.009zbMath1286.05079OpenAlexW2006233650MaRDI QIDQ2450662

Csaba Király, András Frank

Publication date: 14 May 2014

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2013.03.009

zbMATH Keywords

submodular functionorientationedge-connectivitybase-polyhedrontree-composition

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Cites Work

• Uncrossing a family of set-pairs
• Generalized polymatroids and submodular flows
• On the orientation of graphs
• A note on the Frank-Tardos bi-truncation algorithm for crossing- submodular functions
• On the orientation of graphs and hypergraphs
• Graph orientations with edge-connection and parity constraints
• Simple push-relabel algorithms for matroids and submodular flows
• On the degrees of the vertices of a directed graph
• Covering directed and odd cuts
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Structures of polyhedra determined by submodular functions on crossing families
• Robbins's Theorem for Mixed Multigraphs
• An Algorithm for Submodular Functions on Graphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tree-compositions and orientations