Distance Labeling for Permutation Graphs (Q3439382): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.endm.2005.06.098 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966909799 / 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: 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: 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: 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: Implicat Representation of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501559 / 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: 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: 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: Approximate distance oracles / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:09, 25 June 2024

scientific article
Language Label Description Also known as
English
Distance Labeling for Permutation Graphs
scientific article

    Statements

    Distance Labeling for Permutation Graphs (English)
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    algorithms
    0 references
    data-structure
    0 references
    distributed algorithms
    0 references
    distance queries
    0 references
    distance labeling scheme
    0 references
    permutation graphs
    0 references

    Identifiers

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