Zobrazeno 1 - 10
of 328
pro vyhledávání: '"Köhler, Ekkehard A."'
The last in-tree recognition problem asks whether a given spanning tree can be derived by connecting each vertex with its rightmost left neighbor of some search ordering. In this study, we demonstrate that the last-in-tree recognition problem for Gen
Externí odkaz:
http://arxiv.org/abs/2404.18645
Autor:
Beisegel, Jesse, Chiarelli, Nina, Köhler, Ekkehard, Milanič, Martin, Muršič, Peter, Scheffler, Robert
We propose a novel way of generalizing the class of interval graphs, via a graph width parameter called the simultaneous interval number. This parameter is related to the simultaneous representation problem for interval graphs and defined as the smal
Externí odkaz:
http://arxiv.org/abs/2404.10670
Publikováno v:
In European Journal of Political Economy January 2025 86
Publikováno v:
In European Journal of Political Economy March 2024 82
Publikováno v:
28th Annual European Symposium on Algorithms (ESA 2020). LIPIcs vol. 173, 2020, p. 13:1-13:13
Lexicographic Depth First Search (LexDFS) is a special variant of a Depth First Search (DFS), which was introduced by Corneil and Krueger in 2008. While this search has been used in various applications, in contrast to other graph searches, no genera
Externí odkaz:
http://arxiv.org/abs/2005.03523
Publikováno v:
In International Review of Economics and Finance January 2024 89 Part A:1422-1441
Publikováno v:
In Journal of Comparative Economics June 2023 51(2):640-652
Autor:
Beisegel, Jesse, Denkert, Carolin, Köhler, Ekkehard, Krnc, Matjaž, Pivač, Nevena, Scheffler, Robert, Strehler, Martin
Graph searches and the corresponding search trees can exhibit important structural properties and are used in various graph algorithms. The problem of deciding whether a given spanning tree of a graph is a search tree of a particular search on this g
Externí odkaz:
http://arxiv.org/abs/1811.09249
Autor:
Beisegel, Jesse, Denkert, Carolin, Köhler, Ekkehard, Krnc, Matjaž, Pivač, Nevena, Scheffler, Robert, Strehler, Martin
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 21 no. 1, ICGT 2018 (June 13, 2019) dmtcs:4937
End vertices of graph searches can exhibit strong structural properties and are crucial for many graph algorithms. The problem of deciding whether a given vertex of a graph is an end-vertex of a particular search was first introduced by Corneil, K\"o
Externí odkaz:
http://arxiv.org/abs/1810.12253
Autor:
Feld, Lars P., Köhler, Ekkehard A.
Publikováno v:
Zeitschrift für Politik, 2021 Jun 01. 68(2), 167-174.
Externí odkaz:
https://www.jstor.org/stable/48760199