Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Roman Haag"'
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:
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:
CIKM
Clustering graph data has gained much attention in recent years, as data represented as graphs is ubiquitous in today's applications. For many applications, besides the mere graph data also further information about the vertices of a graph is availab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c879c77789565a19aa4fc63ac7e8ae2
https://doi.org/10.1145/2505515.2508200
https://doi.org/10.1145/2505515.2508200
Publikováno v:
ICDM Workshops
Analyzing databases with many attributes per object is a recent challenge. For these high dimensional data it is known that traditional clustering algorithms fail to detect meaningful patterns. As a solution subspace clustering techniques were introd
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df4eafb757dc9c4fa054a86b3ad7c7d2
https://doi.org/10.1109/icdmw.2012.31
https://doi.org/10.1109/icdmw.2012.31