| Autor: |
Jan Kratochvil, Zbigniew Lonc, Mariusz Meszka, Zdzisław Skupień |
| Jazyk: |
angličtina |
| Rok vydání: |
2004 |
| Předmět: |
|
| Zdroj: |
Opuscula Mathematica, Vol 24, Iss 1, Pp 97-102 (2004) |
| Druh dokumentu: |
article |
| ISSN: |
1232-9274 |
| Popis: |
We establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges. If the two edge multiplicities are distinct, the problem is NPC; if mutually equal then polynomial. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
