Found: 8
Select item for more details and to access through your institution.
Deferred-query: An efficient approach for some problems on interval graphs.
- Published in:
- Networks, 1999, v. 34, n. 1, p. 1, doi. 10.1002/(SICI)1097-0037(199908)34:1<1::AID-NET1>3.0.CO;2-C
- By:
- Publication type:
- Article
On the memory overhead of distributed snapshots.
- Published in:
- Networks, 1999, v. 34, n. 1, p. 11, doi. 10.1002/(SICI)1097-0037(199908)34:1<11::AID-NET2>3.0.CO;2-X
- By:
- Publication type:
- Article
Path problems in networks with vector-valued edge weights.
- Published in:
- Networks, 1999, v. 34, n. 1, p. 19, doi. 10.1002/(SICI)1097-0037(199908)34:1<19::AID-NET3>3.0.CO;2-6
- By:
- Publication type:
- Article
Lower bounds for linear interval routing.
- Published in:
- Networks, 1999, v. 34, n. 1, p. 37, doi. 10.1002/(SICI)1097-0037(199908)34:1<37::AID-NET4>3.0.CO;2-7
- By:
- Publication type:
- Article
Deadlock-free interval routing schemes.
- Published in:
- Networks, 1999, v. 34, n. 1, p. 47, doi. 10.1002/(SICI)1097-0037(199908)34:1<47::AID-NET5>3.0.CO;2-3
- By:
- Publication type:
- Article
Optimal edge coloring of large graphs.
- Published in:
- Networks, 1999, v. 34, n. 1, p. 61, doi. 10.1002/(SICI)1097-0037(199908)34:1<61::AID-NET6>3.0.CO;2-G
- By:
- Publication type:
- Article
An optimal algorithm for layered wheel floorplan designs.
- Published in:
- Networks, 1999, v. 34, n. 1, p. 67, doi. 10.1002/(SICI)1097-0037(199908)34:1<67::AID-NET7>3.0.CO;2-W
- By:
- Publication type:
- Article
A competitive analysis for retransmission timeout.
- Published in:
- Networks, 1999, v. 34, n. 1, p. 73, doi. 10.1002/(SICI)1097-0037(199908)34:1<73::AID-NET8>3.0.CO;2-3
- By:
- Publication type:
- Article