✦ LIBER ✦

A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity

✍ Scribed by Barnes, Greg; Buss, Jonathan F.; Ruzzo, Walter L.; Schieber, Baruch

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Time--Space Lower Bounds for Directed st

✍ Barnes, Greg; Edmonds, Jeff A. 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 300 KB

A polynomial-time algorithm for affine v

✍ Patrick T. Harker; Baichun Xiao 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 269 KB

A polynomial time bound for Howard's pol

✍ U. Meister; U. Holzbaur 📂 Article 📅 1986 🏛 Springer 🌐 German ⚖ 225 KB

A polynomial time algorithm for obtainin

✍ Shin-ichi Nakayama; Shigeru Masuyama 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Linear time algorithm for finding a pict

✍ P Thanisch; BV McNally; A Robin 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 816 KB

A Deterministic Polynomial-Time Algorith

✍ Lefmann, Hanno; Schmitt, Niels 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 270 KB