A deterministic <i>o(m log m)</i> time algorithm for the reeb graph (Q2874588): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/2261250.2261289 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052911743 / rank | |||
Normal rank | |||
Latest revision as of 18:13, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A deterministic <i>o(m log m)</i> time algorithm for the reeb graph |
scientific article |
Statements
A deterministic <i>o(m log m)</i> time algorithm for the reeb graph (English)
0 references
7 August 2014
0 references
PL topology
0 references
algorithms
0 references
graph connectivity
0 references
Reeb graph
0 references
