✦ LIBER ✦

On the time-space complexity of reachability queries for preprocessed graphs

✍ Scribed by Lisa Hellerstein; Philip Klein; Robert Wilber

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient evaluation of reachability que

✍ Awny Sayed; Mohammed Kayed; Mayyada Hammoshi 📂 Article 📅 2012 🏛 Elsevier 🌐 English ⚖ 767 KB

On the Time–Space Complexity of Geometri

✍ Joos Heintz; Guillermo Matera; Ariel Waissbein 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 424 KB

The complexity of some reachability prob

✍ Christian Golaszewski; Peter J. Ramadge 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 330 KB

A note on the density of oracle decreasi

✍ Pavol Ďuriš; JoséD.P. Rolim 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 717 KB

On the complexity of some edge-partition

✍ Zbigniew Lonc 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 515 KB

On the complexity of the sandwich proble

✍ C.M.H. de Figueiredo; L. Faria; S. Klein; R. Sritharan 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 722 KB