Zobrazeno 1 - 10
of 66
pro vyhledávání: '"Koehler, Henning"'
Answering the shortest-path distance between two arbitrary locations is a fundamental problem in road networks. Labelling-based solutions are the current state-of-the-arts to render fast response time, which can generally be categorised into hub-base
Externí odkaz:
http://arxiv.org/abs/2311.11063
Many real-world applications operate on dynamic graphs that undergo rapid changes in their topological structure over time. However, it is challenging to design dynamic algorithms that are capable of supporting such graph changes efficiently. To circ
Externí odkaz:
http://arxiv.org/abs/2204.11012
Computing shortest paths is a fundamental operation in processing graph data. In many real-world applications, discovering shortest paths between two vertices empowers us to make full use of the underlying structure to understand how vertices are rel
Externí odkaz:
http://arxiv.org/abs/2104.09733
Autor:
Koehler, Henning
A transitive graph is 2-dimensional if it can be represented as the intersection of two linear orders. Such representations make answering of reachability queries trivial, and allow many problems that are NP-hard on arbitrary graphs to be solved in p
Externí odkaz:
http://arxiv.org/abs/1904.03558
Publikováno v:
In Information Systems May 2023 115
Autor:
Koehler, Henning
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and algorithms for d
Externí odkaz:
http://arxiv.org/abs/1710.04333
Autor:
Koehler, Henning
A common approach in designing relational databases is to start with a relation schema, which is then decomposed into multiple subschemas. A good choice of sub- schemas can often be determined using integrity constraints defined on the schema. Two ce
Externí odkaz:
http://hdl.handle.net/10179/806
Autor:
Balamuralikrishna, Nishita, Jiang, Yingnan, Koehler, Henning, Leck, Uwe, Link, Sebastian, Prade, Henri
Publikováno v:
In Fuzzy Sets and Systems 1 December 2019 376:1-36
Autor:
Koehler, Henning, Link, Sebastian
Publikováno v:
In Journal of Computer and System Sciences May 2017 85:104-131