A randomized <i>O</i> ( <i>m</i> log <i>m</i> ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes (Q5405891): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 20:26, 5 March 2024
scientific article; zbMATH DE number 6278579
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
