A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International Computer Science Symposium (15. : 2020 : Online) Computer science - theory and applications
1. Verfasser: Rupp, Tobias (VerfasserIn)
Weitere Verfasser: Funke, Stefan (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2020
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Parameterized Analysis of Art Gallery and Terrain Guarding 2020 Agrawal, Akanksha
An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter 2020 Babu, Jasine
On the Parameterized Complexity of the Expected Coverage Problem 2020 Fomin, Fedor V.
Parameterized Complexity of Fair Feedback Vertex Set Problem. 2020 Kanesh, Lawqueen
Speedable Left-c.e. Numbers 2020 Merkle, Wolfgang
The subtrace order and counting first-order logic 2020 Kuske, Dietrich
Central Positions in Social Networks 2020 Brandes, Ulrik
Isomorphic Distances Among Elections 2020 Faliszewski, Piotr
Tandem Duplications, Segmental Duplications and Deletions, and Their Applications 2020 Zhu, Binhai
Faster 2-Disjoint-Shortest-Paths Algorithm 2020 Akhmedov, Maxim
Randomized and Symmetric Catalytic Computation 2020 Datta, Samir
The Power of Leibniz-Like Functions as Oracles 2020 Kim, Jaeyoon
Optimal Skeleton Huffman Trees Revisited 2020 Kosolobov, Dmitry
On Computing the Hamiltonian Index of Graphs 2020 Philip, Geevarghese
Kernelization of ARC DISJOINT CYCLE PACKING in α-Bounded Digraphs 2020 Sahu, Abhishek
Weighted Rooted Trees: Fat or Tall? 2020 Wu, Yaokun
On Subquadratic Derivational Complexity of Semi-Thue Systems 2020 Talambutsa, Alexey
Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations 2020 Ablayev, Farid
Second-Order Finite Automata 2020 Melo, Alexsander Andrade de
Definable Subsets of Polynomial-Time Algebraic Structures 2020 Bazhenov, Nikolay
Alle Artikel auflisten