scientific article; zbMATH DE number 1517141

DOI<17::AID-NET3>3.0.CO;2-Z 10.1002/1097-0037(200008)36:1<17::AID-NET3>3.0.CO;2-ZzbMath0971.90010MaRDI QIDQ4509380

Walid Ben-Ameur

Publication date: 15 October 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graphsconnectivityfault-tolerancetelecommunicationslength constraintscontainer theory

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Connectivity (05C40)

Related Items (8)

Minimumk-geodetically connected digraphs ⋮ Routing of uncertain traffic demands ⋮ Towards minimumk-geodetically connected graphs ⋮ Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation ⋮ Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth ⋮ The Menger number of the Cartesian product of graphs ⋮ On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths ⋮ Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: