Self-adjusting linear networks with ladder demand graph

DOI10.1007/978-3-031-32733-9_7arXiv2207.03948OpenAlexW4377971775MaRDI QIDQ6188150

Iosif Salem, Stefan Schmid, Vitaly Aksenov, Anton Paramonov

Publication date: 11 January 2024

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

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

zbMATH Keywords

online algorithmsladder graphtraffic patternsself-adjusting networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Online balanced repartitioning
• The Itinerant List Update problem

This page was built for publication: Self-adjusting linear networks with ladder demand graph