Partitioning graphs into two trees

Ulrich Pferschy; Gerhard J. Woeginger; En-Yu Yao

Skip to main content Skip to main navigation menu Skip to site footer

Partitioning graphs into two trees

Ulrich Pferschy
Gerhard J. Woeginger
En-Yu Yao

Downloads

Download data is not yet available.

PDF

Published

1994-01-01

How to Cite

Pferschy, U., Woeginger, G. J., & Yao, E.-Y. (1994). Partitioning graphs into two trees. Acta Cybernetica, 11(3), 233-240. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3431

Download Citation

Issue

Vol 11 No 3 (1994)

Section

Regular articles

Most read articles by the same author(s)

Gerhard J. Woeginger, Computing maximum valued regions , Acta Cybernetica: Vol 10 No 4 (1992)
Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger, A lower bound for on-line vector-packing algorithms , Acta Cybernetica: Vol 11 No 1-2 (1993)
Günter Rote, Gerhard J. Woeginger, Minimizing the number of tardy jobs on a single machine with batch setup times , Acta Cybernetica: Vol 13 No 4 (1998)
Luitpold Babel, Gerhard J. Woeginger, Pseudo-hamiltonian graphs , Acta Cybernetica: Vol 14 No 4 (2000)
Gerhard J. Woeginger, Jiří Sgall, The complexity of coloring graphs without long induced paths , Acta Cybernetica: Vol 15 No 1 (2001)
Petra Schuur, Gerhard J. Woeginger, A PTAS for single machine scheduling with controllable processing times , Acta Cybernetica: Vol 15 No 3 (2002)
Gerhard J. Woeginger, An algorithmic comparison of three scientific impact indices , Acta Cybernetica: Vol 19 No 3 (2010)
Christian Eggermont, Cor Hurkens, Gerhard J. Woeginger, Realizing small tournaments through few permutations , Acta Cybernetica: Vol 21 No 2 (2013)