✦ LIBER ✦

The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs

✍ Scribed by Lars Døvling Andersen; Herbert Fleischner

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 821 KB
Volume: 59
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)80001-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the numbers of spanning trees and Eul

On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs

✍ Xueliang Li; Fuji Zhang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 756 KB

Counting spanning trees in the graphs of

Counting spanning trees in the graphs of Kleitman and Golden and a generalization

✍ R. Vohra; L. Washington 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 302 KB

A new calculation is given for the number of spanning trees in a family of labellec; graphs considered by Kleitman and Golden, and for a more general class of such graphs.

Finding the connected components and a m

Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane

✍ Hiroshi Imai; Takao Asano 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 732 KB

A method of solving the travelling sales

A method of solving the travelling salesman problem with the help of integer programming: The problem of finding Hamilton paths of the shortest length in a complete graph

✍ V.I. Mudrov 📂 Article 📅 1963 🏛 Elsevier Science ⚖ 249 KB