A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs (Q1969943)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1417531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs |
scientific article; zbMATH DE number 1417531 |
Statements
A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs (English)
0 references
19 July 2000
0 references
multigraph
0 references
edge-splitting theorem
0 references
0.96345913
0 references
0.88618875
0 references
0.87656575
0 references
0.87532264
0 references
0.87513465
0 references
0.87371975
0 references
0.8733661
0 references
0.8733661
0 references
