A randomized <i>O</i> ( <i>m</i> log <i>m</i> ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes (Q5405891)
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 randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes |
scientific article; zbMATH DE number 6278579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A randomized <i>O</i> ( <i>m</i> log <i>m</i> ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes |
scientific article; zbMATH DE number 6278579 |
Statements
A randomized <i>O</i> ( <i>m</i> log <i>m</i> ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes (English)
0 references
3 April 2014
0 references
randomized algorithms
0 references
Reeb graph
0 references
topology
0 references
0.9278806
0 references
0.9258283
0 references
0.8895966
0 references
0.8820642
0 references
0 references
0.8677467
0 references
0 references
