On compact and efficient routing in certain graph classes (Q997073): 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.dam.2007.03.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070631758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneously orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: r-domination problems on homogeneously orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory requirement for universal routing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535803 / 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: Q4796196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory requirement for routing in distributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling and Implicit Routing in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:36, 26 June 2024

scientific article
Language Label Description Also known as
English
On compact and efficient routing in certain graph classes
scientific article

    Statements

    On compact and efficient routing in certain graph classes (English)
    0 references
    0 references
    0 references
    19 July 2007
    0 references
    message routing
    0 references
    localized distributed algorithms
    0 references
    tree-decomposition
    0 references
    acyclic clustering
    0 references
    chordal bipartite graphs
    0 references
    homogeneously orderable graphs
    0 references

    Identifiers

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