Visiting infinitely often the unit interval while minimizing the idle time of high priority segments
From MaRDI portal
Publication:2303307
DOI10.1007/978-3-030-24922-9_30OpenAlexW2961059192MaRDI QIDQ2303307
Publication date: 3 March 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-24922-9_30
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx)
This page was built for publication: Visiting infinitely often the unit interval while minimizing the idle time of high priority segments
