Combined connectivity augmentation and orientation problems

A. Frank, Tamás Király

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages130-144
Number of pages15
Volume2081
ISBN (Print)3540422250, 9783540422259
Publication statusPublished - 2001
Event8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001 - Utrecht, Netherlands
Duration: Jun 13 2001Jun 15 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2081
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001
CountryNetherlands
CityUtrecht
Period6/13/016/15/01

Fingerprint

Augmentation
Connectivity
Branch
Graph in graph theory
Mixed Graphs
Graph Connectivity
Undirected Graph
Cardinality
Target
Requirements

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Frank, A., & Király, T. (2001). Combined connectivity augmentation and orientation problems. In 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.

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Frank, A & Király, T 2001, Combined connectivity augmentation and orientation problems. in 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.
Frank A, Király T. Combined connectivity augmentation and orientation problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2081. Springer Verlag. 2001. p. 130-144. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Frank, A. ; Király, Tamás. / Combined connectivity augmentation and orientation problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2081 Springer Verlag, 2001. pp. 130-144 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ca83ceeb5878444a9475675cc3c42997,
title = "Combined connectivity augmentation and orientation problems",
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.",
author = "A. Frank and Tam{\'a}s Kir{\'a}ly",
year = "2001",
language = "English",
isbn = "3540422250",
volume = "2081",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "130--144",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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 -