An efficient algorithm for simultaneously deducing minimal paths as well as cuts of a communication network

✍ Scribed by M.A. Samad

• Publisher: Elsevier Science
• Year: 1987
• Tongue: English
• Weight: 399 KB
• Volume: 27
• Category: Article
• ISSN: 0026-2714
• DOI: 10.1016/0026-2714(87)90458-6