Found: 7
Select item for more details and to access through your institution.
Partial line directed hypergraphs.
- Published in:
- Networks, 2002, v. 39, n. 2, p. 61, doi. 10.1002/net.10013
- By:
- Publication type:
- Article
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone.
- Published in:
- Networks, 2002, v. 39, n. 2, p. 68, doi. 10.1002/net.10014
- By:
- Publication type:
- Article
Edge-cutsets in the directed hypercube.
- Published in:
- Networks, 2002, v. 39, n. 2, p. 73, doi. 10.1002/net.10011
- By:
- Publication type:
- Article
Minimum-weight rooted not-necessarily-spanning arborescence problem.
- Published in:
- Networks, 2002, v. 39, n. 2, p. 77, doi. 10.1002/net.10015
- By:
- Publication type:
- Article
Deterministic radio broadcasting at low cost.
- Published in:
- Networks, 2002, v. 39, n. 2, p. 88, doi. 10.1002/net.10016
- By:
- Publication type:
- Article
Oriented hypercubes.
- Published in:
- Networks, 2002, v. 39, n. 2, p. 98, doi. 10.1002/net.10012
- By:
- Publication type:
- Article
Models for the design and analysis of a large package sort facility.
- Published in:
- Networks, 2002, v. 39, n. 2, p. 107, doi. 10.1002/net.10017
- By:
- Publication type:
- Article