How to make a graph four-connected.
- Published in:
- Mathematical Programming, 1999, v. 84, n. 3, p. 555, doi. 10.1007/s101070050039
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 1999 AND VI 84 AND IP 3
Results: 12
1
2
Connectivity augmentation of networks: structures and algorithms.
- Published in:
- Mathematical Programming, 1999, v. 84, n. 3, p. 439, doi. 10.1007/s101070050031
- By:
- Publication type:
- Article
3
Edge-augmentation of hypergraphs.
- Published in:
- Mathematical Programming, 1999, v. 84, n. 3, p. 443, doi. 10.1007/s101070050032
- By:
- Publication type:
- Article
4
Hypergraph connectivity augmentation.
- Published in:
- Mathematical Programming, 1999, v. 84, n. 3, p. 519, doi. 10.1007/s101070050036
- By:
- Publication type:
- Article
5
Parallel and fast sequential algorithms for undirected edge connectivity augmentation.
- Published in:
- Mathematical Programming, 1999, v. 84, n. 3, p. 595
- By:
- Publication type:
- Article
6
Successive edge-connectivity augmentation problems.
- Published in:
- Mathematical Programming, 1999, v. 84, n. 3, p. 577, doi. 10.1007/s101070050041
- By:
- Publication type:
- Article
7
Augmenting hypergraphs by edges of size two.
- Published in:
- Mathematical Programming, 1999, v. 84, n. 3, p. 467, doi. 10.1007/s101070050033
- By:
- Publication type:
- Article
8
Covering symmetric supermodular functions by graphs.
- Published in:
- Mathematical Programming, 1999, v. 84, n. 3, p. 483
- By:
- Publication type:
- Article
9
Coverings and structure of crossing families.
- Published in:
- Mathematical Programming, 1999, v. 84, n. 3, p. 505, doi. 10.1007/s101070050035
- By:
- Publication type:
- Article
10
A 1-(S,T)-edge-connectivity augmentation algorithm.
- Published in:
- Mathematical Programming, 1999, v. 84, n. 3, p. 529, doi. 10.1007/s101070050037
- By:
- Publication type:
- Article
11
Directed vertex-connectivity augmentation.
- Published in:
- Mathematical Programming, 1999, v. 84, n. 3, p. 537, doi. 10.1007/s101070050038
- By:
- Publication type:
- Article
12
Increasing the rooted-connectivity of a digraph by one.
- Published in:
- Mathematical Programming, 1999, v. 84, n. 3, p. 565, doi. 10.1007/s101070050040
- By:
- Publication type:
- Article