Graphs, branchwidth, and tangles! Oh my!
- Published in:
- Networks, 2005, v. 45, n. 2, p. 55, doi. 10.1002/net.20050
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2005 AND VI 45 AND IP 2
Results: 7
1
2
Strong formulations for network design problems with connectivity requirements.
- Published in:
- Networks, 2005, v. 45, n. 2, p. 61, doi. 10.1002/net.20046
- By:
- Publication type:
- Article
3
Diameter vulnerability of iterated line digraphs in terms of the girth.
- Published in:
- Networks, 2005, v. 45, n. 2, p. 49, doi. 10.1002/net.20049
- By:
- Publication type:
- Article
4
Connectedness of digraphs and graphs under constraints on the conditional diameter.
- Published in:
- Networks, 2005, v. 45, n. 2, p. 80, doi. 10.1002/net.20051
- By:
- Publication type:
- Article
5
All-port line broadcasting in highly connected graphs.
- Published in:
- Networks, 2005, v. 45, n. 2, p. 95, doi. 10.1002/net.20055
- By:
- Publication type:
- Article
6
Balanced paths in acyclic networks: Tractable cases and related approaches.
- Published in:
- Networks, 2005, v. 45, n. 2, p. 104, doi. 10.1002/net.20053
- By:
- Publication type:
- Article
7
On the fault-tolerant diameter and wide diameter of ω-connected graphs.
- Published in:
- Networks, 2005, v. 45, n. 2, p. 88, doi. 10.1002/net.20054
- By:
- Publication type:
- Article