Succinct posets (Q329288): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-015-0047-1 / 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.1007/s00453-015-0047-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2911589947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Enumeration of Partial Orders on a Finite Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact binary relation representations with rich functionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct indexes for strings, binary relations and multilabeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowest common ancestors in trees and directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average number of linear extensions of a partial order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting and Selection in Posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient implicit data structure for relation testing and searching in partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Representation of Posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct encoding of arbitrary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique partitions, graph compression and speeding-up algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree structure for distributive lattices and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3767386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locally presented posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: String realizers of posets with applications to distributed computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hardness of Approximating Poset Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Finite Topologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding bipartite subgraphs efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of embedding orders into small products of chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing graphs implicitly using almost optimal space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Data Structure for Lattice Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact oracles for reachability and approximate distances in planar digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-015-0047-1 / rank
 
Normal rank

Latest revision as of 14:27, 9 December 2024

scientific article
Language Label Description Also known as
English
Succinct posets
scientific article

    Statements

    Succinct posets (English)
    0 references
    0 references
    0 references
    0 references
    21 October 2016
    0 references
    succinct data structure
    0 references
    graph representations
    0 references
    partial orders
    0 references
    rank and select
    0 references
    Zarankiewicz problem
    0 references
    balanced bipartite graphs
    0 references
    graph compression
    0 references
    data compression
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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