✦ LIBER ✦

On the recognition complexity of some graph properties

✍ Scribed by Eberhard Triesch

Publisher: Springer-Verlag
Year: 1996
Tongue: English
Weight: 487 KB
Volume: 16
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01844851

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of comparability graph re

The complexity of comparability graph recognition and coloring

✍ M. C. Golumbic 📂 Article 📅 1977 🏛 Springer Vienna 🌐 English ⚖ 470 KB

The complexity of some graph colouring p

The complexity of some graph colouring problems

✍ Keith Edwards 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 896 KB

On the complexity of graph reconstructio

On the complexity of graph reconstruction

✍ Dieter Kratsch; Lane A. Hemaspaandra 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 942 KB

Recognition of some perfectly orderable

Recognition of some perfectly orderable graph classes

✍ Elaine M. Eschen; Julie L. Johnson; Jeremy P. Spinrad; R Sritharan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 190 KB

On the computational complexity of graph

On the computational complexity of graph closures

✍ Angelo Monti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 375 KB

On the complexity of graph tree partitio

On the complexity of graph tree partition problems

✍ Roberto Cordone; Francesco Maffioli 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 270 KB

This paper concerns the optimal partition of a graph into p connected clusters of vertices, with various constraints on their topology and weight. We consider di erent objectives, depending on the cost of the trees spanning the clusters. This rich family of problems mainly applies to telecommunicati