### Abstract

Two important branches of graph connectivity problems are connectivity augmentation, which consists of augmenting a graph by adding new edges so as to meet a specified target connectivity, and connectivity orientation, where the goal is to find an orientation of an undirected or mixed graph that satisfies some specified edge-connection property. In the present work an attempt is made to link the above two branches, by considering degree-specified and minimum cardinality augmentation of graphs so that the resulting graph has an orientation satisfying a prescribed edge-connection requirement, such as (k, l)-edgeconnectivity. Our proof technique involves a combination of the supermodular polyhedral methods used in connectivity orientation, and the splitting of operation, which is a standard tool in solving augmentation problems.

Original language | English |
---|---|

Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Publisher | Springer Verlag |

Pages | 130-144 |

Number of pages | 15 |

Volume | 2081 |

ISBN (Print) | 3540422250, 9783540422259 |

Publication status | Published - 2001 |

Event | 8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001 - Utrecht, Netherlands Duration: Jun 13 2001 → Jun 15 2001 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 2081 |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001 |
---|---|

Country | Netherlands |

City | Utrecht |

Period | 6/13/01 → 6/15/01 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*(Vol. 2081, pp. 130-144). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2081). Springer Verlag.

**Combined connectivity augmentation and orientation problems.** / Frank, A.; Király, Tamás.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).*vol. 2081, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2081, Springer Verlag, pp. 130-144, 8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001, Utrecht, Netherlands, 6/13/01.

}

TY - GEN

T1 - Combined connectivity augmentation and orientation problems

AU - Frank, A.

AU - Király, Tamás

PY - 2001

Y1 - 2001

N2 - Two important branches of graph connectivity problems are connectivity augmentation, which consists of augmenting a graph by adding new edges so as to meet a specified target connectivity, and connectivity orientation, where the goal is to find an orientation of an undirected or mixed graph that satisfies some specified edge-connection property. In the present work an attempt is made to link the above two branches, by considering degree-specified and minimum cardinality augmentation of graphs so that the resulting graph has an orientation satisfying a prescribed edge-connection requirement, such as (k, l)-edgeconnectivity. Our proof technique involves a combination of the supermodular polyhedral methods used in connectivity orientation, and the splitting of operation, which is a standard tool in solving augmentation problems.

AB - Two important branches of graph connectivity problems are connectivity augmentation, which consists of augmenting a graph by adding new edges so as to meet a specified target connectivity, and connectivity orientation, where the goal is to find an orientation of an undirected or mixed graph that satisfies some specified edge-connection property. In the present work an attempt is made to link the above two branches, by considering degree-specified and minimum cardinality augmentation of graphs so that the resulting graph has an orientation satisfying a prescribed edge-connection requirement, such as (k, l)-edgeconnectivity. Our proof technique involves a combination of the supermodular polyhedral methods used in connectivity orientation, and the splitting of operation, which is a standard tool in solving augmentation problems.

UR - http://www.scopus.com/inward/record.url?scp=84947246067&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947246067&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84947246067

SN - 3540422250

SN - 9783540422259

VL - 2081

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 130

EP - 144

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -