A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph (Q2391712)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A deterministic O(m m) time algorithm for the Reeb graph |
scientific article; zbMATH DE number 6194821
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph |
scientific article; zbMATH DE number 6194821 |
Statements
A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph (English)
0 references
5 August 2013
0 references
algorithms
0 references
Reeb graph
0 references
PL topology
0 references
graph connectivity
0 references
0 references
0.9980927109718324
0 references
0.8485677242279053
0 references
0.8244277834892273
0 references
0.8055497407913208
0 references
0.8007751703262329
0 references
