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
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Rephael Wenger / rank
Normal rank
 
Property / author
 
Property / author: Rephael Wenger / rank
 
Normal rank
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/1810959.1811005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089763657 / rank
 
Normal rank

Latest revision as of 20:03, 19 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
    0 references
    0 references
    0 references
    3 April 2014
    0 references
    randomized algorithms
    0 references
    Reeb graph
    0 references
    topology
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references