A study on the tie-set graph theory and network flow optimization problems
Authors:
- 12 November 2004
- journal article
- research article
- Published by Wiley in International Journal of Circuit Theory and Applications
- Vol. 32 (6) , 447-470
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Generalized loop-back recovery in optical mesh networksIEEE/ACM Transactions on Networking, 2002
- A theory of tie‐set graph and its application to information network managementInternational Journal of Circuit Theory and Applications, 2001
- Architectural issues for robust optical accessIEEE Communications Magazine, 2001
- On metaheuristic algorithms for combinatorial optimization problemsSystems and Computers in Japan, 2001
- Traffic engineering with MPLS in the InternetIEEE Network, 2000
- On the Complexity of Finding a Minimum Cycle Cover of a GraphSIAM Journal on Computing, 1997
- An algorithm for designing rings for survivable fiber networksIEEE Transactions on Reliability, 1991