✦ LIBER ✦

On graph problems in a semi-streaming model

✍ Scribed by Joan Feigenbaum; Sampath Kannan; Andrew McGregor; Siddharth Suri; Jian Zhang

Book ID: 108281108
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 207 KB
Volume: 348
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.09.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Weighted Matching in the Semi-Streaming

Weighted Matching in the Semi-Streaming Model

✍ Mariano Zelke 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 670 KB

Bipartite Matching in the Semi-streaming

Bipartite Matching in the Semi-streaming Model

✍ Sebastian Eggert; Lasse Kliemann; Peter Munstermann; Anand Srivastav 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 717 KB

Graph optimization model in priority pro

Graph optimization model in priority problems

✍ V. G. Vizing 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 743 KB

Optimal per-edge processing times in the

Optimal per-edge processing times in the semi-streaming model

✍ Mariano Zelke 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 141 KB

Graph Distances in the Data-Stream Model

✍ Feigenbaum, Joan; Kannan, Sampath; McGregor, Andrew; Suri, Siddharth; Zhang, Jia 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 280 KB

Controlled Semi-Markovian Fields on a Gr

Controlled Semi-Markovian Fields on a Graph

✍ R.K. Chornei 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 49 KB