✦ LIBER ✦

The 2-linkage problem for acyclic digraphs

✍ Scribed by Carsten Thomassen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The covering values for acyclic digraph

✍ Lei Li; Xueliang Li 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 366 KB

The Even Cycle Problem for Planar Digrap

✍ C. Thomassen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 604 KB

We present a polynomial time algorithm for deciding if a planar digraph has a dicycle of even length. 1993 Academic Press, Inc.

The size distribution for Markov equival

✍ Steven B. Gillispie; Michael D. Perlman 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 191 KB

The even-path problem for graphs and dig

✍ Andrea S. Lapaugh; Christos H. Papadimitriou 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB

The completable digraphs for the totally

✍ Cristina Jordán; Juan-R. Torregrosa; Ramadán el-Ghamry 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 173 KB

Approximations for the maximum acyclic s

✍ Refael Hassin; Shlomi Rubinstein 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 722 KB