TY - JOUR
T1 - An Optimal Algorithm for Directing Triple Systems Using Eulerian Circuits
AU - Harms, Janelle J.
AU - Colbourn, Charles J.
N1 - Funding Information:
* Research supported by NSERC Canada under grant A5047.
PY - 1985/1/1
Y1 - 1985/1/1
N2 - An optimal algorithm is developed which, given an arbitrary edge-decomposition of the complete multi-graph 2λKv into copies of K3, (a triple system), produces an arc-decomposition of the complete directed multigraph λK*v into copies of the transitive tournament of order three. This algorithm is based on the well-known linear time algorithm for finding Eulerian circuits in multigraphs.
AB - An optimal algorithm is developed which, given an arbitrary edge-decomposition of the complete multi-graph 2λKv into copies of K3, (a triple system), produces an arc-decomposition of the complete directed multigraph λK*v into copies of the transitive tournament of order three. This algorithm is based on the well-known linear time algorithm for finding Eulerian circuits in multigraphs.
UR - http://www.scopus.com/inward/record.url?scp=77952489183&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77952489183&partnerID=8YFLogxK
U2 - 10.1016/S0304-0208(08)73034-2
DO - 10.1016/S0304-0208(08)73034-2
M3 - Article
AN - SCOPUS:77952489183
SN - 0304-0208
VL - 115
SP - 433
EP - 438
JO - North-Holland Mathematics Studies
JF - North-Holland Mathematics Studies
IS - C
ER -