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. © 2009 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Fukunaga, T. (2009). Graph orientations with set connectivity requirements. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 265–274). https://doi.org/10.1007/978-3-642-10631-6_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
