✦ LIBER ✦

Parsimonious flooding in dynamic graphs

✍ Scribed by Hervé Baumann; Pierluigi Crescenzi; Pierre Fraigniaud

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Flooding in dynamic graphs with arbitrar

✍ Baumann, Hervé; Crescenzi, Pierluigi; Fraigniaud, Pierre 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 624 KB

Algorithms for parsimonious complete set

✍ Avraham A. Melkman; Solomon E. Shimony 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 433 KB

The Flooding Time in Random Graphs

✍ Remco Van Der Hofstad; Gerard Hooghiemstra; Piet van Mieghem 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 242 KB

Dynamic Interfacial Tension In Surfactan

✍ Taylor, Kevin C.; Hawkins, Blaine F.; Islam, M. Rafiq 📂 Article 📅 1990 🏛 Society of Petroleum Engineers 🌐 English ⚖ 335 KB

Maximal Paths in Random Dynamic Graphs

✍ Loulou, Richard 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 559 KB

Finding All Maximal Cliques in Dynamic G

✍ Volker Stix 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 95 KB