| Research>>> Acta Cybernetica>>> Previous Volumes>>> | Magyarul |
Partitioning Graphs into Two Trees
Ulrich Pferschy Gerhard
J. Woeginger En-Yu
Yao
Abstract:
We investigate the problem of partitioning the edges of a graph into two trees of equal size. We prove that this problem is NP-complete in general, but can be solved in polynomial time on series-parallel graphs.
Gyenizse Pal 1996. Szeptember 4. Szerda 13:20:41 MET DST