scientific article; zbMATH DE number 1340884

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199908)34:1<47::AID-NET5>3.0.CO;2-3" /><47::AID-NET5>3.0.CO;2-3 10.1002/(SICI)1097-0037(199908)34:1<47::AID-NET5>3.0.CO;2-3zbMath0959.90006MaRDI QIDQ4262694

Michele Flammini

Publication date: 2 May 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

\(k\)-interval labeling schemes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)

Related Items (2)

Low-congested interval routing schemes for hypercubelike networks ⋮ Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing

Cites Work

• Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings
• Requirements for deadlock-free, adaptive packet routing

This page was built for publication: