scientific article; zbMATH DE number 1517141

DOI10.1002/1097-0037(200008)36:1%3C17::AID-NET3%3E3.0.CO;2-ZMaRDI QIDQ4509380zbMATH OpenFDO

Authors Walid Ben-Ameur

Publication date 15 October 2000

Full work available at URL https://doi.org/10.1002/1097-0037(200008)36:1%3C17::AID-NET3%3E3.0.CO;2-Z

zbMATH Keywords

connectivitycontainer theoryfault-tolerancegraphslength constraintstelecommunications

Mathematics Subject Classification ID

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

Recommendations

• On the minimum number of edges of two-connected graphs with given diameter
• Two node-disjoint hop-constrained survivable network design and polyhedra
• Low-connectivity network design on series-parallel graphs
• Design of survivable networks with vulnerability constraints
• Properties of optimal survivable paths in a graph

Cited in

(9)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509380)