Building efficient and compact data structures for simplicial complexes (Q2408925): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linear Automaton Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved behaviour of tries by adaptive branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the representation of simplicial complexes by trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient data structure for representing and simplifying simplicial complexes in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper-minimizing minimized deterministic finite state automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building Efficient and Compact Data Structures for Simplicial Complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal cover-automata for finite languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Construction and Maintenance of Minimal Finite-State Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Trie Index Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Construction of Minimal Acyclic Finite-State Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2963895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete Transition Complexity of Some Basic Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5740410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimisation of acyclic deterministic automata in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal insertion in deterministic DAWGs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763424 / rank
 
Normal rank

Latest revision as of 13:21, 14 July 2024

scientific article
Language Label Description Also known as
English
Building efficient and compact data structures for simplicial complexes
scientific article

    Statements

    Building efficient and compact data structures for simplicial complexes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    simplicial complex
    0 references
    compact data structures
    0 references
    simplex automaton
    0 references
    NP-hardness
    0 references
    0 references