Automata, Languages and Programming
From MaRDI portal
Publication:5466491
DOI10.1007/b99859zbMath1099.68679MaRDI QIDQ5466491
Siddharth Suri, Andrew McGregor, Jian Zhang, Joan Feigenbaum, Sampath Kannan
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Adapting parallel algorithms to the W-stream model, with applications to graph problems, New results for finding common neighborhoods in massive graphs in the data stream model, Streaming algorithm for graph spanners-single pass and constant processing time per edge, Intractability of min- and max-cut in streaming graphs, Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models, Optimal per-edge processing times in the semi-streaming model, Weighted matching in the semi-streaming model, Bipartite matching in the semi-streaming model