Characterization results of all shortest paths interval routing schemes (Q2744657): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q286983
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Umberto Nanni / 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.1002/net.1017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117860759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On interval routing schemes and treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional interval routing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval routing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On devising Boolean Routing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing networks with compact routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on interval routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial characterizations of networks supporting shortest path interval labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling and Implicit Routing in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Routing / rank
 
Normal rank

Latest revision as of 20:10, 3 June 2024

scientific article
Language Label Description Also known as
English
Characterization results of all shortest paths interval routing schemes
scientific article

    Statements

    Characterization results of all shortest paths interval routing schemes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    interval routing
    0 references
    shortest paths
    0 references
    dynamic cost
    0 references
    0 references