Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph

DOI10.1006/JAGM.2000.1119MaRDI QIDQ4521519zbMATH OpenOpenAlexFDO

Authors Jørgen Bang-Jensen, Tibor Jordán

Publication date 1 November 2001

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/e070125b4e8b8e862bdc531d4ed72f55ea953785

zbMATH Keywords

\(R\)-splitting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Splitting off edges between two subsets preserving the edge-connectivity of the graph.
• Edge-splittings preserving local edge-connectivity of graphs
• Constrained Edge-Splitting Problems
• scientific article; zbMATH DE number 1303570
• scientific article; zbMATH DE number 1342136

Cited in

(8)

• An edge-splitting algorithm in planar graphs
• Splitting off edges between two subsets preserving the edge-connectivity of the graph.
• A unifying approach to splitting-off
• Approximate edge splitting
• Edge-connectivity augmentations of~graphs~and~hypergraphs
• A New Approach to Splitting-Off
• Constrained Edge-Splitting Problems
• Bipartition constrained edge-splitting in directed graphs

This page was built for publication: Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph

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