Partitioning graphs into two trees
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.
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
1994
|
| Series: | Acta cybernetica
11 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12531 |
| Summary: | 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. |
|---|---|
| Physical Description: | 233-240 |
| ISSN: | 0324-721X |