论文信息 - Algorithms for finding a rooted (k, 1)-edge-connected orientation

Algorithms for finding a rooted (k, 1)-edge-connected orientation

A digraph is called rooted (k,1)-edge-connected if it has a root node r"0 such that there exist k arc-disjoint paths from r"0 to every other node and there is a path from every node to r"0. Here we give a simple algorithm for finding a (k,1)-edge-connected orientation of a graph. A slightly more complicated variation of this algorithm has running time O(n^4+n^2m) that is better than the time bound of the previously known algorithms. With the help of this algorithm one can check whether an undirected graph is highly k-tree-connected, that is, for each edge e of the graph G, there are k edge-disjoint spanning trees of G not containing e. High tree-connectivity plays an important role in the investigation of redundantly rigid body-bar graphs.

Csaba Király | C. Király

[1] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[2] J. Edmonds. Minimum partition of a matroid into independent subsets , 1965 .

[3] Tibor Jordán,et al. Generic global rigidity of body-bar frameworks , 2013, J. Comb. Theory B.

[4] W. T. Tutte. On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[5] S. Hakimi. On the degrees of the vertices of a directed graph , 1965 .

[6] Harold N. Gabow,et al. Packing algorithms for arborescences (and spanning trees) in capacitated graphs , 1995, Math. Program..

[7] András Frank,et al. Egerváry Research Group on Combinatorial Optimization on the Orientation of Graphs and Hypergraphs on the Orientation of Graphs and Hypergraphs , 2022 .

[8] András Frank,et al. On the orientation of graphs , 1980, J. Comb. Theory, Ser. B.

[9] András Frank,et al. Generalized polymatroids and submodular flows , 1988, Math. Program..

[10] Satoru Fujishige,et al. A note on the Frank—Tardos bi-truncation algorithm for crossing-submodular functions , 1992, Math. Program..

[11] A. Frank. Connections in Combinatorial Optimization , 2011 .