Graph Orientations with Set Connectivity Requirements

Authors:
Takuro Fukunaga
Affiliations:
Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan
Venue:
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Year:
2009

Citing 4
Cited 2

Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
The Set Connector Problem in Graphs

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Augmenting edge-connectivity between vertex subsets

CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
An algorithm for source location in directed graphs

Operations Research Letters

Strong orientations of planar graphs with bounded stretch factor

SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Strongly connected orientations of plane graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In an undirected or directed graph, the edge-connectivity between two disjoint vertex sets X and Y is defined as the minimum number of edges or arcs that should be removed for disconnecting all vertices in Y from those in X. In this paper, we discuss several conditions for a given undirected graph to have an orientation meeting the edge-connectivity requirements defined on some pairs of vertex sets.