Hardness of peeling with stashes

DOI10.1016/j.ipl.2016.05.006zbMath1362.68233arXiv1410.5169MaRDI QIDQ2630336

Michael Mitzenmacher, Vikram Nathan

Publication date: 27 July 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.5169

zbMATH Keywords

NP-completeness; graph algorithms; hashing; peeling process; stash

Mathematics Subject Classification ID

68W40: Analysis of algorithms

05C80: Random graphs (graph-theoretic aspects)

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)