Edge-splitting problems with demands

DOI10.1007/3-540-48777-8_21MaRDI QIDQ4263718zbMATH OpenFDO

Authors Tibor Jordán

Publication date 4 March 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48777-8_21

zbMATH Keywords

edge-splitting problemspolymatroid intersection theorempolynomial algorithm

Mathematics Subject Classification ID

Graph theory (05C99) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Constrained Edge-Splitting Problems
• scientific article; zbMATH DE number 3983202
• Approximability of partitioning graphs with supply and demand
• On the complexity of some edge-partition problems for graphs
• Bipartition constrained edge-splitting in directed graphs
• The SONET edge‐partition problem
• Approximability of Partitioning Graphs with Supply and Demand
• Approximating multicut and the demand graph
• Splitting Edge Partitions of Graphs
• Critical edges for the assignment problem: complexity and exact resolution

Cited in

(10)

• An edge-splitting algorithm in planar graphs
• Splitting off edges between two subsets preserving the edge-connectivity of the graph.
• Polyhedral structure of submodular and posi-modular systems
• Edge-splittings preserving local edge-connectivity of graphs
• Edge-splitting and edge-connectivity augmentation in planar graphs
• Constrained Edge-Splitting Problems
• Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
• Bipartition constrained edge-splitting in directed graphs
• Graph connectivity and its augmentation: Applications of MA orderings

This page was built for publication: Edge-splitting problems with demands

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263718)