✦ LIBER ✦

Finding an Even Simple Path in a Directed Planar Graph

✍ Scribed by Nedev, Zhivko Prodanov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding k Disjoint Paths in a Directed P

✍ Schrijver, Alexander 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 976 KB

Finding a homotopy base for directed pat

✍ Kazuo Murota; Satoru Fujishige 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 337 KB

On finding the simple paths and circuits

✍ Danielson, G. 📂 Article 📅 1968 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 276 KB

A simple solution to the two paths probl

✍ Gerhard Woeginger 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 154 KB

Improved algorithms for finding length-b

✍ Chih-Chiang Yu; Chien-Hsin Lin; Biing-Feng Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 323 KB

A Polynomial-Time Algorithm for Finding

✍ Zhivko P. Nedev; Peter T. Wood 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 266 KB