✦ LIBER ✦

Historical note on optimum spanning arborescences

✍ Scribed by J. D. Murchland

Publisher: John Wiley and Sons
Year: 1973
Tongue: English
Weight: 115 KB
Volume: 3
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230030307

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on finding optimum branchings

✍ P. M. Camerini; L. Fratta; F. Maffioli 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 205 KB

A note on bisecting minimum spanning tre

A note on bisecting minimum spanning trees

✍ W. M. Boyce; M. R. Garey; D. S. Johnson 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB

Editorial on historical notes

✍ Borko, Harold 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

In your editorial in the May issue of JASIS, which arrived today, I note with pleasure that you will be featuring a series of historical perspective pieces during this year. It is certainly very important for every field in every profession to take a historical look at itself from time to time so th

An historical note on highway hypnosis

✍ Griffith W. Williams; Ronald E. Shor 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 241 KB

A note on graphs with diameter-preservin

A note on graphs with diameter-preserving spanning trees

✍ Fred Buckley; Martin Lewinter 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB 👁 1 views

The distance between a pair of vertices u, u in a graph G is the length of a shortest path joining u and u. The diameter diam(G) of G is the maximum distance between all pairs of vertices in G. A spanning tree Tof G is diameter preserving if diam(T) = diam(G). In this note, we characterize graphs th

A note on graphs spanned by Eulerian gra

A note on graphs spanned by Eulerian graphs

✍ W. R. Pulleyblank 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 1 views

## Abstract We show that the problem raised by Boesch, Suffel, and Tindell of determining whether or not a graph is spanned by an Eulerian subgraph is NP‐complete. We also note that there does exist a good algorithm for determining if a graph is spanned by a subgraph having positive even degree at