Space limited linear-time graph algorithms on big data

DOI10.1016/j.tcs.2024.114468MaRDI QIDQ6196840

No author found.

Publication date: 15 March 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

maximal matchingvertex coverbig dataedge dominating setstreaming algorithmkernelization algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New parameterized algorithms for the edge dominating set problem
• On randomized one-round communication complexity
• Vertex Cover: Further Observations and Further Improvements
• Kernels for Edge Dominating Set: Simpler or Smaller
• Streaming Kernelization
• Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms
• Communication Complexity (for Algorithm Designers)
• edge dominating set: Efficient Enumeration-Based Exact Algorithms
• Vertex packings: Structural properties and algorithms
• Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
• Kernelization
• Faster Update Time for Turnstile Streaming Algorithms
• Parameterized Streaming: Maximal Matching and Vertex Cover
• Parameterized Algorithms

This page was built for publication: Space limited linear-time graph algorithms on big data