Linear-time parameterized algorithms with limited local resources
type: Item
instance of: scholarly article
title: Linear-time parameterized algorithms with limited local resources
author: Ying Guo
author: Qin Huang
author: Jianer Chen
published in: Information and Computation
publication date: 2022-12-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/2003.02866
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7629144
zbMATH Keywords: bigdata
zbMATH Keywords: linear-time algorithm
zbMATH Keywords: space complexity
zbMATH Keywords: graph matching
describes a project that uses: Pregel
MaRDI profile type: Publication
OpenAlex ID: W3010618012
cites work: Dynamic Parameterized Problems and Algorithms
cites work: Towards a theory of parameterized streaming algorithms
cites work: Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
cites work: Parameterized Streaming: Maximal Matching and Vertex Cover
cites work: Q3651735
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond
cites work: Streaming Kernelization
cites work: On graph problems in a semi-streaming model
cites work: Kernelization
cites work: Q3138921
cites work: Data Structures for Weighted Matching and Extensions to b -matching and f -factors
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: The Power of Linear-Time Data Reduction for Maximum Matching
cites work: Q3425115
cites work: Sublinear Time Algorithms
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Undirected single-source shortest paths with positive integer weights in linear time
cites work: A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
DOI: 10.1016/J.IC.2022.104951
description: scientific article; zbMATH DE number 7629144