Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs (Q3408176): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2115833060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Object location using path separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified View of Graph Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating all pairs shortest paths in restricted graph families: a unified approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on interval routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficiency for routing schemes of stretch factor three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Compactness of Interval Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Compactness of Interval Routing for Almost All Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Routing onk-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computing of efficient routing schemes in generalized chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between space and efficiency for routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling and Implicit Routing in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact oracles for reachability and approximate distances in planar digraphs / rank
 
Normal rank

Latest revision as of 11:21, 2 July 2024

scientific article
Language Label Description Also known as
English
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs
scientific article

    Statements

    Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs (English)
    0 references
    0 references
    0 references
    0 references
    24 February 2010
    0 references
    routing scheme
    0 references
    stretch
    0 references
    chordal graph
    0 references
    distributed algorithm
    0 references

    Identifiers