Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Malte Renken"'
Publikováno v:
Discrete Applied Mathematics. 307:65-78
The classical, linear-time solvable Feedback Edge Set problem is concerned with finding a minimum number of edges intersecting all cycles in a (static, unweighted) graph. We provide a first study of this problem in the setting of temporal graphs, whe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26d0e9ebd3fb64383d361641ee2348e5
https://doi.org/10.1016/j.dam.2021.09.029
https://doi.org/10.1016/j.dam.2021.09.029
Publikováno v:
Network Science. 9:S83-S105
Isolation is a concept originally conceived in the context of clique enumeration in static networks, mostly used to model communities that do not have much contact to the outside world. Herein, a clique is considered isolated if it has few edges conn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db9a47b74ff1674c4f86bb83a2af22c0
https://doi.org/10.1017/nws.2020.38
https://doi.org/10.1017/nws.2020.38
Autor:
Malte Renken, Vincent Froese
Publikováno v:
Discrete & Computational Geometry. 66:737-750
Terrain visibility graphs are a well-known graph class in computational geometry. They are closely related to polygon visibility graphs, but a precise graph-theoretical characterization is still unknown. Over the last decade, terrain visibility graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9bdea5d0db08c1b0085938b0cf04ff5
https://doi.org/10.1007/s00454-020-00226-8
https://doi.org/10.1007/s00454-020-00226-8
Removing all connections between two vertices s and z in a graph by removing a minimum number of vertices is a fundamental problem in algorithmic graph theory. This (s,z)-separation problem is well-known to be polynomial solvable and serves as an imp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78d3f57635b88066f457071290ff1e98
http://arxiv.org/abs/2105.12003
http://arxiv.org/abs/2105.12003
Publikováno v:
IJCAI
To address the dynamic nature of real-world networks, we generalize competitive diffusion games and Voronoi games from static to temporal graphs, where edges may appear or disappear over time. This establishes a new direction of studies in the area o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06865cb17021652a9eeeb3460371c71e
http://arxiv.org/abs/2105.05987
http://arxiv.org/abs/2105.05987
Publikováno v:
Fundamentals of Computation Theory ISBN: 9783030865924
FCT
FCT
Disconnecting two vertices s and z in a graph by removing a minimum number of vertices is a fundamental problem in algorithmic graph theory. This (s, z)-Separation problem is well-known to be polynomial solvable and serves as an important primitive i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d767ce05f2e2138c6baac254cd445118
https://doi.org/10.1007/978-3-030-86593-1_27
https://doi.org/10.1007/978-3-030-86593-1_27
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783030604394
WG
WG
The classical, linear-time solvable Feedback Edge Set problem is concerned with finding a minimum number of edges intersecting all cycles in a (static, unweighted) graph. We provide a first study of this problem in the setting of temporal graphs, whe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::914246fef0fb8fb9ad4f64257c0fe714
https://doi.org/10.1007/978-3-030-60440-0_16
https://doi.org/10.1007/978-3-030-60440-0_16
Publikováno v:
Treewidth, Kernels, and Algorithms ISBN: 9783030420703
Treewidth, Kernels, and Algorithms
Treewidth, Kernels, and Algorithms
Treewidth is arguably the most important structural graph parameter leading to algorithmically beneficial graph decompositions. Triggered by a strongly growing interest in temporal networks (graphs where edge sets change over time), we discuss fresh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a1a3cbb7127de57a0ec6765d2570569b
https://doi.org/10.1007/978-3-030-42071-0_6
https://doi.org/10.1007/978-3-030-42071-0_6
Publikováno v:
Complex Networks and Their Applications VIII ISBN: 9783030366827
COMPLEX NETWORKS (2)
COMPLEX NETWORKS (2)
Isolation is a concept from the world of clique enumeration that is mostly used to model communities that do not have much contact to the outside world. Herein, a clique is considered isolated if it has few edges connecting it to the rest Motivated b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::403211a8399532f9ec41dc9acdca8dcb
https://doi.org/10.1007/978-3-030-36683-4_42
https://doi.org/10.1007/978-3-030-36683-4_42
Publikováno v:
Complex Networks and Their Applications VIII ISBN: 9783030366827
COMPLEX NETWORKS (2)
COMPLEX NETWORKS (2)
The links between vertices within many real-world networks change over time. Correspondingly, there has been a recent boom in studying temporal graphs. Proximity-based pattern recognition in temporal graphs requires a (dis)similarity measure to compa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5409ce815e24dbf18443fa88e38c95ab
https://doi.org/10.1007/978-3-030-36683-4_38
https://doi.org/10.1007/978-3-030-36683-4_38