A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
type: Item
instance of: scholarly article
title: A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
zbMATH Open document ID: 0952.68114
author: Hiroshi Nagamochi
author: S. Nakamura
author: Toshihide Ibaraki
published in: Algorithmica
publication date: 2000-07-19T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1417531
zbMATH Keywords: multigraph
zbMATH Keywords: edge-splitting theorem
MaRDI profile type: Publication
full work available at URL: s004539910004
OpenAlex ID: W2079573299
DOI: 10.1007/S004539910004
Recommended article: Q4228455
Recommended article: Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs
Recommended article: An edge-splitting algorithm in planar graphs
Recommended article: An O(n2) Algorithm for Undirected Split Decomposition
Recommended article: Efficient splitting off algorithms for graphs
Recommended article: \(O(m\log n)\) split decomposition of strongly-connected graphs
Recommended article: O(m logn) Split Decomposition of Strongly Connected Graphs
Recommended article: Faster Parameterized Algorithms for Deletion to Split Graphs
Recommended article: Faster parameterized algorithms for deletion to split graphs
Recommended article: A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem
description: scientific article; zbMATH DE number 1417531