Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees.
- Published in:
- Networks, 1975, v. 5, n. 3, p. 237, doi. 10.1002/net.1975.5.3.237
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1975 AND VI 5 AND IP 3
Results: 4
1
2
The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-Bonds.
- Published in:
- Networks, 1975, v. 5, n. 3, p. 253, doi. 10.1002/net.1975.5.3.253
- By:
- Publication type:
- Article
3
Multiterminal Path Flows for Packet-Switching Communication Networks.
- Published in:
- Networks, 1975, v. 5, n. 3, p. 205, doi. 10.1002/net.1975.5.3.205
- By:
- Publication type:
- Article
4
GRAPH THEORY WITH APPLICATIONS TO ENGINEERING AND COMPUTER SCIENCE.
- Published in:
- Networks, 1975, v. 5, n. 3, p. 299, doi. 10.1002/net.1975.5.3.299
- By:
- Publication type:
- Article