Skip to main content
Book Chapter

Network Design Problems

Springer Berlin Heidelberg, (2007), 491-525
DOI: 10.1007/978-3-540-71844-4_20
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Connectivity is a very important concept in combinatorial optimization. In Chapter 8 we showed how to compute the connectivity between each pair of vertices of an undirected graph. Now we are looking for subgraphs that satisfy certain connectivity requirements. The general problem is:

Cite

CITATION STYLE

APA

Network Design Problems. (2007). In Combinatorial Optimization (pp. 491–525). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-71844-4_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free