A tourist guide through treewidth
A short overview is given of many recent results in algorithmic graph theory that deal with the notions treewidth, and pathwidth. We discuss algorithms that find tree-decompositions, algorithms that use tree-decompositions to solve hard problems efficiently, graph minor theory, and some applications...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1993
|
| Sorozat: | Acta cybernetica
11 No. 1-2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12517 |
| LEADER | 01077nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12517 | ||
| 005 | 20220613104635.0 | ||
| 008 | 161015s1993 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 Bodlaender H. L. | |
| 245 | 1 | 2 | |a A tourist guide through treewidth |h [elektronikus dokumentum] / |c Bodlaender H. L. |
| 260 | |c 1993 | ||
| 300 | |a 1-21 | ||
| 490 | 0 | |a Acta cybernetica |v 11 No. 1-2 | |
| 520 | 3 | |a A short overview is given of many recent results in algorithmic graph theory that deal with the notions treewidth, and pathwidth. We discuss algorithms that find tree-decompositions, algorithms that use tree-decompositions to solve hard problems efficiently, graph minor theory, and some applications. The paper contains an extensive bibliography. | |
| 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 | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12517/1/cybernetica_011_numb_001_002_001-021.pdf |z Dokumentum-elérés |