scientific article; zbMATH DE number 1256720

MaRDI QIDQ4228455zbMATH OpenFDO

Authors Hiroshi Nagamochi, Toshihide Ibaraki

Publication date 18 May 1999

zbMATH Keywords

edge-splittinggraph algorithmsmultigraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Deterministic O(nm) time edge-splitting in undirected graphs
• A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
• A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem
• Augmenting Undirected Edge Connectivity in Õ(n2) Time

Cited in

(13)

• Deterministic O(nm) time edge-splitting in undirected graphs
• A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
• Approximate edge splitting
• Efficient splitting off algorithms for graphs
• scientific article; zbMATH DE number 1303592 (Why is no real title available?)
• Augmenting Undirected Edge Connectivity in Õ(n2) Time
• Fast edge orientation for unweighted graphs
• A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem
• Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities
• Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities
• A new contraction technique with applications to congruency-constrained cuts
• On 2-strong connectivity orientations of mixed graphs and related problems
• \(O(m\log n)\) split decomposition of strongly-connected graphs

This page was built for publication:

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