Space limited graph algorithms on big data

DOI10.1007/978-3-031-22105-7_23MaRDI QIDQ6113850

No author found.

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

maximal matchingbig dataedge dominating set

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• New parameterized algorithms for the edge dominating set problem
• Linear-time parameterized algorithms with limited local resources
• Vertex Cover: Further Observations and Further Improvements
• Kernels for Edge Dominating Set: Simpler or Smaller
• Streaming Kernelization
• edge dominating set: Efficient Enumeration-Based Exact Algorithms
• Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
• Kernelization
• Parameterized Streaming: Maximal Matching and Vertex Cover

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