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
Revision as of 20:03, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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