✦ LIBER ✦

On the addressing problem for directed graphs

✍ Scribed by F. R. K. Chung; R. L. Graham; P. M. Winkler

Book ID: 110567462
Publisher: Springer Japan
Year: 1985
Tongue: English
Weight: 425 KB
Volume: 1
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf02582927

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Isomorphism Problem For Directed Pat

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs

✍ L. Babel; I.N. Ponomarenko; G. Tinhofer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 237 KB

This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown. We prove that deciding isomorphism of directed path

Addressing the Numbers Problem in Direct

Addressing the Numbers Problem in Directed Evolution

✍ Manfred T. Reetz; Daniel Kahakeaw; Renate Lohmer 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 525 KB

A Convergence Problem on Finite Directed

A Convergence Problem on Finite Directed Graphs

✍ Dachs, Jose N. W. 📂 Article 📅 1971 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 475 KB

The best choice problem for upward direc

The best choice problem for upward directed graphs

✍ Małgorzata Sulkowska 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 234 KB

An approach for the Steiner problem in d

An approach for the Steiner problem in directed graphs

✍ Nelson Maculan; Paulo Souza; Alfredo Candia Vejar 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 506 KB

Extremal problems for directed graphs

✍ W.G Brown; P Erdös; M Simonovits 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 858 KB