QP-2010-02

Simple algorithm for (k,1)-arc-connected orientation of a graph

Csaba Király



Abstract

We give a simple algorithm for orienting a (k,1)-partition-connected graph with a root r_0 to become r_0-rooted (k,1)-arc-connected. Our algorithm also works for hypergraphs.


Bibtex entry:

@techreport{egresqp-10-02,
AUTHOR = {Kir{\'a}ly, Csaba},
TITLE = {Simple algorithm for (k,1)-arc-connected orientation of a graph},
NOTE= {{\tt www.cs.elte.hu/egres}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2010},
NUMBER = {QP-2010-02}
}


Last modification: 26.9.2017. Please email your comments to Tamás Király!