Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs

Hiroshi Nagamochi and Toshihide Ibaraki
Additional contact information
Hiroshi Nagamochi: Kyoto University
Toshihide Ibaraki: Kyoto University

Journal of Combinatorial Optimization, 1997, vol. 1, issue 1, No 1, 5-46

Abstract: Abstract This paper presents a deterministic O (nm log n + n2log2n) = Õ (nm) time algorithm for splitting off all edges incident to a vertex s of even degree in a multigraph G, where n and m are the numbers of vertices and links (= vertex pairs between which G has an edge) in G, respectively. Based on this, many graph algorithms using edge-splitting can run faster. For example, the edge-connectivity augmentation problem in an undirected multigraph can be solved in Õ (nm) time, which is an improvement over the previously known randomized Õ (n3) bound and deterministic Õ (n2m) bound.

Keywords: Mathematical Modeling; Industrial Mathematic; Discrete Geometry; Undirected Graph; Time Algorithm (search for similar items in EconPapers)
Date: 1997
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009739202898 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:1:y:1997:i:1:d:10.1023_a:1009739202898

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009739202898

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().