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.
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1994
|
| Sorozat: | Acta cybernetica
11 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12531 |
| LEADER | 01010nab a2200241 i 4500 | ||
|---|---|---|---|
| 001 | acta12531 | ||
| 005 | 20220613115124.0 | ||
| 008 | 161015s1994 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Pferschy Ulrich | |
| 245 | 1 | 0 | |a Partitioning graphs into two trees |h [elektronikus dokumentum] / |c Pferschy Ulrich |
| 260 | |c 1994 | ||
| 300 | |a 233-240 | ||
| 490 | 0 | |a Acta cybernetica |v 11 No. 3 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 700 | 0 | 1 | |a Woeginger Gerhard J. |e aut |
| 700 | 0 | 1 | |a Yao En-Yu |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12531/1/cybernetica_011_numb_003_233-240.pdf |z Dokumentum-elérés |