Fast and Simple Connectivity in Graph Timelines

DOI10.1007/978-3-319-21840-3_38zbMath1451.68205arXiv1506.02973OpenAlexW2963032522MaRDI QIDQ3449843

Jakub Łącki, Adam Karczmarz

Publication date: 30 October 2015

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

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (1)

How fast can we play Tetris greedily with rectangular pieces?

This page was built for publication: Fast and Simple Connectivity in Graph Timelines