On graph problems in a semi-streaming model
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2005/12/01
-
Journal
-
Indian UGC (journal)
-
Refrences21
-
Citations68
-
Joan Feigenbaum
-
Sampath Kannan
-
Andrew McGregor
-
Siddharth Suri
-
Jian Zhang
Cite
Feigenbaum, Joan, et al. “On Graph Problems in a Semi-Streaming Model”. Theoretical Computer Science, vol. 348, no. 2-3, 2005, pp. 207-16, https://doi.org/10.1016/j.tcs.2005.09.013.
Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., & Zhang, J. (2005). On graph problems in a semi-streaming model. Theoretical Computer Science, 348(2-3), 207-216. https://doi.org/10.1016/j.tcs.2005.09.013
Feigenbaum, Joan, Sampath Kannan, Andrew McGregor, Siddharth Suri, and Jian Zhang. “On Graph Problems in a Semi-Streaming Model”. Theoretical Computer Science 348, no. 2-3 (2005): 207-16. https://doi.org/10.1016/j.tcs.2005.09.013.
Feigenbaum J, Kannan S, McGregor A, Suri S, Zhang J. On graph problems in a semi-streaming model. Theoretical Computer Science. 2005;348(2-3):207-16.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| On finding common neighborhoods in massive graphs | 2003 | |||
| An approximate L1 difference algorithm for massive data streams | SIAM Journal on Computing |
| 2002 | |
| A Functional Approach to External Graph Algorithms | Algorithmica |
| 22 | 2002 |
| Parallel approximation algorithms for maximum weighted matching in general graphs | Information Processing Letters |
| 2000 | |
| The Space Complexity of Approximating the Frequency Moments | Journal of Computer and System Sciences |
| 247 | 1999 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions | SIAM Journal on Computing |
| 2024 | |
GraphZeppelin
: How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive) | ACM Transactions on Database Systems |
| 2024 | |
| Improved Bounds for Matching in Random-Order Streams | Theory of Computing Systems |
| 2023 | |
| Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model | Algorithmica |
| 2023 | |
| Streaming deletion problems parameterized by vertex cover | Theoretical Computer Science |
| 2023 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software 52
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled A linear time deterministic algorithm to find a small subset that approximates the centroid and was published in 2007. The most recent citation comes from a 2024 study titled Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. This article reached its peak citation in 2017, with 8 citations. It has been cited in 29 different journals, 3% of which are open access. Among related journals, the Algorithmica cited this research the most, with 10 citations. The chart below illustrates the annual citation trends for this article.