Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Parameterized streaming : maximal matching and vertex cover

Tools
- Tools
+ Tools

Chitnis, Rajesh, Cormode, Graham, Hajiaghayi, Mohammad Taghi and Monezimadeh, Morteza (2015) Parameterized streaming : maximal matching and vertex cover. In: ACM SIAM Symposium on Discrete Algorithms (SODA), San Diego, USA, 4-6 Jan 2015. Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 1234-1251. ISBN 9781611973747. doi:10.1137/1.9781611973730.82

[img]
Preview
PDF
WRAP_Cormode_paramstreaming__.pdf - Accepted Version - Requires a PDF viewer.

Download (933Kb) | Preview
Official URL: https://doi.org/10.1137/1.9781611973730.82

Request Changes to record.

Abstract

As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one. However, few results are known for optimization problems over such dynamic graph streams. In this paper, we introduce a new approach to handling graph streams, by instead seeking solutions for the parameterized versions of these problems. Here, we are given a parameter k and the objective is to decide whether there is a solution bounded by k. By combining kernelization techniques with randomized sketch structures, we obtain the first streaming algorithms for the parameterized versions of Maximal Matching and Vertex Cover. We consider various models for a graph stream on n nodes: the insertion-only model where the edges can only be added, and the dynamic model where edges can be both inserted and deleted. More formally, we show the following results: * In the insertion only model, there is a one-pass deterministic algorithm for the parameterized Vertex Cover problem which computes a sketch using O~(k2) space [ O~(f(k))=O(f(k)·logO(1) m), where m is the number of edges.] such that at each timestamp in time ~O(2k) it can either extract a solution of size at most k for the current instance, or report that no such solution exists. We also show a tight lower bound of Ω(k2) for the space complexity of any (randomized) streaming algorithms for the parameterized Vertex Cover, even in the insertion-only model. * In the dynamic model, and under the promise that at each timestamp there is a maximal matching of size at most k, there is a one-pass O~(k2)-space (sketch-based) dynamic algorithm that maintains a maximal matching with worst-case update time [The time to update the current maximal matching upon an insertion or deletion.] O~(k2). This algorithm partially solves Open Problem 64 from the List of open problems in sublinear algorithms. An application of this dynamic matching algorithm is a one-pass O~(k2)-space streaming algorithm for the parameterized Vertex Cover problem that in time O~(2k) extracts a solution for the final instance with probability 1-δ/nO(1), where δ<1. To the best of our knowledge, this is the first graph streaming algorithm that combines linear sketching with sequential operations that depend on the graph at the current time. * In the dynamic model without any promise, there is a one-pass randomized algorithm for the parameterized Vertex Cover problem which computes a sketch using O~(nk) space such that in time O~(nk+2k) it can either extract a solution of size at most k for the final instance, or report that no such solution exists.

Item Type: Conference Item (Paper)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH): Computer algorithms, Data structures (Computer science)
Journal or Publication Title: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
ISBN: 9781611973747
Official Date: 4 January 2015
Dates:
DateEvent
4 January 2015Published
September 2014Accepted
Page Range: pp. 1234-1251
DOI: 10.1137/1.9781611973730.82
Status: Peer Reviewed
Publication Status: Published
Funder: National Science Foundation (U.S.) (NSF), United States. Office of Naval Research, United States. Defense Advanced Research Projects Agency (DARPA), United States. Air Force. Office of Scientific Research (AFOSR), Simons Foundation , Yahoo Faculty Research and Engagement Program, Royal Society (Great Britain). Wolfson Research Merit Award (RSWRMA)
Grant number: 1053605 (NSF), CCF-1161626 (NSF), N000141110662 (ONR), FA9550-12-1-0423 (DARPO/AFOSR), 2200/1-1(MO)
Conference Paper Type: Paper
Title of Event: ACM SIAM Symposium on Discrete Algorithms (SODA)
Type of Event: Conference
Location of Event: San Diego, USA
Date(s) of Event: 4-6 Jan 2015
Related URLs:
  • Organisation

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us