Graph Orientations with Set Connectivity Requirements

1. Bárász, M., Beckder, J., Frank, A.: An Algorithm for Source Location in Directed Graphs. Operations Research Letters 33, 221–230 (2005)

   Article  MATH  MathSciNet  Google Scholar 

2. Frank, A.: Orientations of Graphs and Submodular Flows. Conguressus Numerantium 113, 111–142 (1996)

   MATH  Google Scholar 

3. Fukunaga, T., Nagamochi, H.: The Set Connector Problem in Graphs. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 484–498. Springer, Heidelberg (2007)

   Chapter  Google Scholar 

4. Ishii, T., Hagiwara, M.: Minimum Augmentation of Local Edge-connectivity between Vertices and Vertex Subsets in Undirected Graphs. Discrete Applied Mathematics 154, 2307–2329 (2006)

   Article  MATH  MathSciNet  Google Scholar 

5. Ishii, T., Makino, K.: Augmenting Edge-connectivity between Vertex Subsets. In: The Australian Theory Symposium on Computing Theory (2008)

   Google Scholar 

6. Ito, H.: Node-to-area Connectivity of Graphs. Transactions of the Institute of Electrical Engineers of Japan 11C, 463–469 (1994)

   Google Scholar 

7. Nash-Williams, C.S.J.A.: On Orientations, Connectivity and Odd Vertex Pairings in Finite Graphs. Canadian Journal of Mathematics 12, 555–567 (1960)

   MATH  MathSciNet  Google Scholar 

Download references