On the public citation graph
Interval Routing Schemes
0 signed · 58 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199701)29:1<49::aid-net5>3.0.co;2-copenalex-snapshot
A lower bound for interval routing in general networks
inferredcites →https://doi.org/10.1007/3-540-60246-1_111openalex-snapshot
The complexity of interval routing on random graphs
inferredcites →https://doi.org/10.1007/3-540-60922-9_43openalex-snapshot
Lower bounds for compact routing
inferredcites →https://doi.org/10.1007/3-540-61769-8_13openalex-snapshot
A lower bound for Linear Interval Routing
inferredcites →https://doi.org/10.1007/bf01762113openalex-snapshot
Designing networks with compact routing tables
inferredcites →https://doi.org/10.1016/0166-218x(94)90180-5openalex-snapshot
Methods and problems of communication in usual networks
inferredcites →https://doi.org/10.1016/0196-6774(90)90017-9openalex-snapshot
Improved routing strategies with succinct tables
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1093/comjnl/28.1.5openalex-snapshot
Labelling and Implicit Routing in Networks
inferredcites →https://doi.org/10.1093/comjnl/34.5.475openalex-snapshot
Short Note: A Note on the Efficiency of an Interval Routing Algorithm
inferredcites →https://doi.org/10.1093/comjnl/39.2.133openalex-snapshot
On Multi-Label Linear Interval Routing Schemes
inferredcites →https://doi.org/10.1093/comjnl/41.1.16openalex-snapshot
The Complexity of Interval Routing on Random Graphs
inferredcites →https://doi.org/10.1109/t-c.1971.223205openalex-snapshot
Parallel Processing with the Perfect Shuffle
inferredcites →https://doi.org/10.1137/0218058openalex-snapshot
Efficient Message Routing in Planar Networks
inferredcites →https://doi.org/10.1137/0219011openalex-snapshot
Space-Efficient Message Routing in c -Decomposable Networks
inferredcites →https://doi.org/10.1142/s0129626497000061openalex-snapshot
On the Hardness of Devising Interval Routing Schemes
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.4153/cjm-1964-055-5openalex-snapshot
A Characterization of Comparability Graphs and of Interval Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199701)29:1<49::aid-net5>3.0.co;2-copenalex-snapshot
A lower bound for interval routing in general networks
inferred← citeshttps://doi.org/10.1002/0470072644openalex-snapshot
Design and Analysis of Distributed Algorithms
inferred← citeshttps://doi.org/10.1006/jagm.1997.0915openalex-snapshot
Worst Case Bounds for Shortest Path Interval Routing
inferred← citeshttps://doi.org/10.1007/10704208_8openalex-snapshot
Low-Level SCI Protocols and Their Application to Flexible Switches
inferred← citeshttps://doi.org/10.1007/11429647_24openalex-snapshot
Geometric Routing Without Geometry
inferred← citeshttps://doi.org/10.1007/11599593_9openalex-snapshot
Distributed Node Location in Clustered Multi-hop Wireless Networks
inferred← citeshttps://doi.org/10.1007/11602613_53openalex-snapshot
An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_174openalex-snapshot
Interval Routing on Layered Cross Product of Trees and Cycles⋆
inferred← citeshttps://doi.org/10.1007/3-540-49477-4_17openalex-snapshot
Efficient Communication Schemes
inferred← citeshttps://doi.org/10.1007/bfb0029969openalex-snapshot
On the dilation of interval routing
inferred← citeshttps://doi.org/10.1007/bfb0030674openalex-snapshot
A simple DFS-Based algorithm for linear interval routing
inferred← citeshttps://doi.org/10.1007/bfb0055087openalex-snapshot
Static and dynamic low-congested interval routing schemes
inferred← citeshttps://doi.org/10.1007/s00224-002-1033-yopenalex-snapshot
Routing in Series Parallel Networks
inferred← citeshttps://doi.org/10.1007/s00224-004-1080-zopenalex-snapshot
Compact Routing Schemes for Dynamic Ring Networks
inferred← citeshttps://doi.org/10.1007/s00224-009-9190-xopenalex-snapshot
Sublinear Fully Distributed Partition with Applications
inferred← citeshttps://doi.org/10.1007/s00446-002-0073-5openalex-snapshot
Compact and localized distributed data structures
inferred← citeshttps://doi.org/10.1007/s00446-012-0179-3openalex-snapshot
Bounding the locality of distributed routing algorithms
inferred← citeshttps://doi.org/10.1007/s004460100058openalex-snapshot
Interval routing schemes allow broadcasting with linear message-complexity
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.07.011openalex-snapshot
Distance and routing labeling schemes for non-positively curved plane graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2009.06.001openalex-snapshot
Ordered interval routing schemes
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.06.013openalex-snapshot
Characterization of networks supporting multi-dimensional linear interval routing schemes
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.008openalex-snapshot
Interval routing in reliability networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00279-1openalex-snapshot
Static and dynamic low-congested interval routing schemes
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00067-1openalex-snapshot
Interval routing in some planar networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00283-2openalex-snapshot
A survey on interval routing
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00027-3openalex-snapshot
The compactness of adaptive routing tables
inferred← citeshttps://doi.org/10.1023/b:supe.0000049325.58858.72openalex-snapshot
Deadlock-Free Multicasting in Irregular Networks Using Prefix Routing
inferred← citeshttps://doi.org/10.1093/comjnl/41.4.238openalex-snapshot
More on the Efficiency of Interval Routing
inferred← citeshttps://doi.org/10.1109/12.780884openalex-snapshot
On the space requirement of interval routing
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5160997openalex-snapshot
A snap-stabilizing point-to-point communication protocol in message-switched networks
inferred← citeshttps://doi.org/10.1109/ipps.1999.760466openalex-snapshot
Dynamic interval routing on asynchronous rings
inferred← citeshttps://doi.org/10.1109/ispan.1999.778911openalex-snapshot
On the interval routing of chordal rings
inferred← citeshttps://doi.org/10.1137/s0895480197328631openalex-snapshot
The Compactness of Interval Routing
inferred← citeshttps://doi.org/10.1142/s0129054117500046openalex-snapshot
Interval Routing Schemes for Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1142/s0129626403001616openalex-snapshot
DEADLOCK-FREE ROUTING IN IRREGULAR NETWORKS USING PREFIX ROUTING
inferred← citeshttps://doi.org/10.1145/1582716.1582756openalex-snapshot
Bounding the locality of distributed routing algorithms
inferred← citeshttps://doi.org/10.1145/298151.298424openalex-snapshot
Fault-tolerant routing in hypercubes using masked interval routing scheme
inferred← citeshttps://doi.org/10.1145/343477.343503openalex-snapshot
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
inferred← citeshttps://doi.org/10.7155/jgaa.00425openalex-snapshot
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.