announcement

New Streaming Algorithms for Parameterized Maximal Matching & Beyond

Authors:

Rajesh Chitnis,

Graham Cormode,

Hossein Esfandiari,

MohammadTaghi Hajiaghayi, and

Morteza MonemizadehAuthors Info & Claims

SPAA '15: Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures

June 2015

Pages 56 - 58

https://doi.org/10.1145/2755573.2755618

Published: 13 June 2015 Publication History

Get Access

Abstract

Very recently at SODA'15 [2], we studied maximal matching via the framework of parameterized streaming, where we sought solutions under the promise that no maximal matching exceeds k in size. In this paper, we revisit this problem and provide a much simpler algorithm for this problem. We are also able to apply the same technique to the Point Line Cover problem [3].

References

[1]

N. Barkay, E. Porat, and B. Shalem. Efficient sampling of non-strict turnstile data streams. In FCT 2013, pages 48--59.

Digital Library

Google Scholar

[2]

R. H. Chitnis, G. Cormode, M. T. Hajiaghayi, and M. Monemizadeh. Parameterized streaming: Maximal matching and vertex cover. In SODA 2015, pages 1234--1251.

Digital Library

Google Scholar

[3]

S. Kratsch, G. Philip, and S. Ray. Point line cover: The easy kernel is essentially tight. In SODA 2014, pages 1596--1606.

Digital Library

Google Scholar

Cited By

View all

Oostveen Jvan Leeuwen E(2024)Parameterized Complexity of Streaming Diameter and Connectivity ProblemsAlgorithmica10.1007/s00453-024-01246-zOnline publication date: 19-Jun-2024
https://doi.org/10.1007/s00453-024-01246-z
Chen JHuang QKanj IXia G(2024)Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big DataAlgorithmica10.1007/s00453-024-01231-686:8(2448-2478)Online publication date: 9-May-2024
https://doi.org/10.1007/s00453-024-01231-6
Oostveen Jvan Leeuwen E(2023)Streaming Deletion Problems Parameterized by Vertex CoverTheoretical Computer Science10.1016/j.tcs.2023.114178(114178)Online publication date: Sep-2023
https://doi.org/10.1016/j.tcs.2023.114178
Show More Cited By

Index Terms

New Streaming Algorithms for Parameterized Maximal Matching & Beyond
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Maximal matching and path matching counting in polynomial time for graphs of bounded clique width
TAMC'11: Proceedings of the 8th annual conference on Theory and applications of models of computation

In this paper, we provide polynomial-time algorithms for different extensions of the matching counting problem, namely maximal matchings, path matchings (linear forest) and paths, on graph classes of bounded clique-width. For maximal matchings, we ...
Read More
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond

We consider the problem of estimating the size of a maximum matching when the edges are revealed in a streaming fashion. When the input graph is planar, we present a simple and elegant streaming algorithm that, with high probability, estimates the size ...
Read More
Distributed Half-Integral Matching and Beyond
Structural Information and Communication Complexity
Abstract
By prior work, it is known that any distributed graph algorithm that finds a maximal matching requires communication rounds, while it is possible to find a maximal fractional matching in O(1) rounds in bounded-degree graphs. However, all prior O(...
Read More

Comments

Information & Contributors

Information

Published In

SPAA '15: Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures

June 2015

362 pages

ISBN:9781450335881

DOI:10.1145/2755573

General Chair:
Guy Blelloch
Carnegie Mellon University, USA
,
Program Chair:
Kunal Agrawal
Washington University in St. Louis, USA

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2015

Check for updates

Author Tags

Qualifiers

Announcement

Funding Sources

Defense Advanced Research Projects Agency
Israeli Centers for Research Excellence
Yahoo Faculty Research and Engagement Program
National Science Foundation
Royal Society
Czech Science Foundation
Office of Naval Research
Google Faculty Research award

Conference

SPAA '15

Sponsor:

SPAA '15: 27th ACM Symposium on Parallelism in Algorithms and Architectures

June 13 - 15, 2015

Oregon, Portland, USA

Acceptance Rates

SPAA '15 Paper Acceptance Rate 31 of 131 submissions, 24%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
176
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

View all

Oostveen Jvan Leeuwen E(2024)Parameterized Complexity of Streaming Diameter and Connectivity ProblemsAlgorithmica10.1007/s00453-024-01246-zOnline publication date: 19-Jun-2024
https://doi.org/10.1007/s00453-024-01246-z
Chen JHuang QKanj IXia G(2024)Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big DataAlgorithmica10.1007/s00453-024-01231-686:8(2448-2478)Online publication date: 9-May-2024
https://doi.org/10.1007/s00453-024-01231-6
Oostveen Jvan Leeuwen E(2023)Streaming Deletion Problems Parameterized by Vertex CoverTheoretical Computer Science10.1016/j.tcs.2023.114178(114178)Online publication date: Sep-2023
https://doi.org/10.1016/j.tcs.2023.114178
Bishnu AGhosh AKolay SMishra GSaurabh S(2023)Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data StreamsTheory of Computing Systems10.1007/s00224-023-10136-w67:6(1241-1267)Online publication date: 20-Sep-2023
https://doi.org/10.1007/s00224-023-10136-w
Chen JGuo YHuang Q(2022)Linear-time parameterized algorithms with limited local resourcesInformation and Computation10.1016/j.ic.2022.104951(104951)Online publication date: Aug-2022
https://doi.org/10.1016/j.ic.2022.104951
Oostveen Jvan Leeuwen E(2021)Streaming Deletion Problems Parameterized by Vertex CoverFundamentals of Computation Theory10.1007/978-3-030-86593-1_29(413-426)Online publication date: 9-Sep-2021
https://doi.org/10.1007/978-3-030-86593-1_29
Bishnu AGhosh AKolay SMishra GSaurabh S(2020)Fixed Parameter Tractability of Graph Deletion Problems over Data StreamsComputing and Combinatorics10.1007/978-3-030-58150-3_53(652-663)Online publication date: 27-Aug-2020
https://doi.org/10.1007/978-3-030-58150-3_53
Behnezhad SDerakhshan MEsfandiari HTan EYami HScheideler CHajiaghayi M(2017)Brief AnnouncementProceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3087556.3087601(133-136)Online publication date: 24-Jul-2017
https://dl.acm.org/doi/10.1145/3087556.3087601
Kliemann L(2016)Engineering a Bipartite Matching Algorithm in the Semi-Streaming ModelAlgorithm Engineering10.1007/978-3-319-49487-6_11(352-378)Online publication date: 11-Nov-2016
https://doi.org/10.1007/978-3-319-49487-6_11

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Maximal matching and path matching counting in polynomial time for graphs of bounded clique width

Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond

Distributed Half-Integral Matching and Beyond