✦ LIBER ✦

The best choice problem for upward directed graphs

✍ Scribed by Małgorzata Sulkowska

Book ID: 119227567
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 234 KB
Volume: 9
Category: Article
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2012.04.001

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

On the addressing problem for directed g

On the addressing problem for directed graphs

✍ F. R. K. Chung; R. L. Graham; P. M. Winkler 📂 Article 📅 1985 🏛 Springer Japan 🌐 English ⚖ 425 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

The best choice problem under ambiguity

✍ Chudjakow, Tatjana; Riedel, Frank 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 244 KB

Extremal problems for directed graphs

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

Objectives in the Best-Choice Problems

✍ Gnedin, Alexander V. 📂 Article 📅 2005 🏛 Taylor and Francis Group 🌐 English ⚖ 142 KB