✦ LIBER ✦

The complexity of two graph orientation problems

✍ Scribed by Nicole Eggemann; Steven D. Noble

Book ID: 113564725
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 198 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.10.036

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of graph embeddability proble

Complexity of graph embeddability problems

✍ C. Benzaken; S. Foldes 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 890 KB

The complexity of some graph colouring p

The complexity of some graph colouring problems

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

The Complexity of Bottleneck Labeled Gra

The Complexity of Bottleneck Labeled Graph Problems

✍ Refael Hassin; Jérôme Monnot; Danny Segev 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 482 KB

Expected complexity of graph partitionin

Expected complexity of graph partitioning problems

✍ Luděk Kučera 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 927 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

Quantum Query Complexity of Some Graph P

Quantum Query Complexity of Some Graph Problems

✍ Dürr, Christoph; Heiligman, Mark; HOyer, Peter; Mhalla, Mehdi 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 249 KB