Localized and compact data-structure for comparability graphs (Q1025540): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.12.091 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985636891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial orders of dimension 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in digraphs of small treewidth. I: Sequential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the all-pair shortest path query problem on interval and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance and routing labeling schemes for non-positively curved plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple linear time recognition of unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query efficient implementation of graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Almost Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance labeling scheme and split decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact and localized distributed data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance labeling in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for proper interval graph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicat Representation of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance labeling schemes for well-separated graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster shortest-path algorithms for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracles for bounded-length shortest paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity-preserving labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interval number of a planar graph: Three intervals suffice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs and poset dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bypassing the embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval representations of planar graphs / 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: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank

Latest revision as of 16:11, 1 July 2024

scientific article
Language Label Description Also known as
English
Localized and compact data-structure for comparability graphs
scientific article

    Statements

    Localized and compact data-structure for comparability graphs (English)
    0 references
    0 references
    0 references
    19 June 2009
    0 references
    algorithms
    0 references
    data-structure
    0 references
    distributed algorithms
    0 references
    distance queries
    0 references
    distance labeling scheme
    0 references
    partially ordered set
    0 references
    permutation graphs
    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