Adding isolated vertices makes some online algorithms optimal

DOI10.1007/978-3-319-29516-9_6MaRDI QIDQ6827501zbMATH OpenFDO

Authors Joan Boyar, Christian Kudahl

Publication date 4 April 2016

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

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Adding isolated vertices makes some online algorithms optimal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6827501)