Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Sandra Kiefer"'
Autor:
Moein E. Samadi, Sandra Kiefer, Sebastian Johaness Fritsch, Johannes Bickenbach, Andreas Schuppert
Publikováno v:
PLoS ONE, Vol 17, Iss 9 (2022)
Mechanistic/data-driven hybrid modeling is a key approach when the mechanistic details of the processes at hand are not sufficiently well understood, but also inferring a model purely from data is too complex. By the integration of first principles i
Externí odkaz:
https://doaj.org/article/b847ef5b6e1f429799d4d9a736d0a262
Autor:
Sandra Kiefer, Pascal Schweitzer
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 2 (2019)
We show that on graphs with n vertices, the 2-dimensional Weisfeiler-Leman algorithm requires at most O(n^2/log(n)) iterations to reach stabilization. This in particular shows that the previously best, trivial upper bound of O(n^2) is asymptotically
Externí odkaz:
https://doaj.org/article/48d48c08429d450ebafe0af8853ffa20
Publikováno v:
ACM SIGLOG News. 9:31-33
This report follows the two latest editions of the International Workshop for Women in Logic (WiL), which took place on June 30 th in 2020 and June 27 th in 2021, respectively. Due to the Corona virus pandemic, both events were held virtually, with s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e74057256c1fb66762a2f4e100e5da70
https://doi.org/10.1145/3537668.3537672
https://doi.org/10.1145/3537668.3537672
Autor:
Sandra Kiefer
Publikováno v:
ACM SIGLOG News. 7:5-27
More than half a century after its first formulation, the Weisfeiler-Leman (WL) algorithm is still an important combinatorial technique whenever graphs or other relational structures are to be classified. However, despite its simple algebraic descrip
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a88f813524322f17b718ffc31d3aca8c
https://doi.org/10.1145/3436980.3436982
https://doi.org/10.1145/3436980.3436982
Publikováno v:
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022
37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022
We give new decomposition theorems for classes of graphs that can be transduced in first-order logic from classes of sparse graphs -- more precisely, from classes of bounded expansion and from nowhere dense classes. In both cases, the decomposition t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92f064f2d63335e82fb168700d2d3baa
http://arxiv.org/abs/2201.11082
http://arxiv.org/abs/2201.11082
Autor:
Sandra Kiefer, Daniel Neuen
Publikováno v:
Saarbrücken/Wadern, Germany : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 138, 45:1-45:15 (2019). doi:10.4230/LIPICS.MFCS.2019.45
44th International Symposium on Mathematical Foundations of Computer Science : MFCS 2019, August 26-30, 2019, Aachen, Germany / edited by Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen
44th International Symposium on Mathematical Foundations of Computer Science : MFCS 2019, August 26-30, 2019, Aachen, Germany / edited by Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen44. International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, 2019-08-26-2019-08-30
44th International Symposium on Mathematical Foundations of Computer Science : MFCS 2019, August 26-30, 2019, Aachen, Germany / edited by Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen
44th International Symposium on Mathematical Foundations of Computer Science : MFCS 2019, August 26-30, 2019, Aachen, Germany / edited by Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen44. International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, 2019-08-26-2019-08-30
The Weisfeiler-Leman procedure is a widely-used technique for graph isomorphism testing that works by iteratively computing an isomorphism-invariant coloring of vertex tuples. Meanwhile, a fundamental tool in structural graph theory, which is often e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4c1751800e5960912322e0bbab9fb5c
We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables. The previously best known upp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::829b3476cf2fd28a978b59e02a3a272d
http://arxiv.org/abs/1708.07354
http://arxiv.org/abs/1708.07354
Autor:
Pascal Schweitzer, Sandra Kiefer
Publikováno v:
LICS
We show that on graphs with n vertices the 2-dimensional Weisfeiler-Leman algorithm requires at most O(n2 / log(n)) iterations to reach stabilization. This in particular shows that the previously best, trivial upper bound of O(n2) is asymptotically n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58fd7263168d853048e756d67b006d2e
https://doi.org/10.1145/2933575.2933595
https://doi.org/10.1145/2933575.2933595
Publikováno v:
Mathematical Foundations of Computer Science 2015 ISBN: 9783662480564
MFCS (1)
MFCS (1)
We classify graphs and, more generally, finite relational structures that are identified by \({C^{2}}\), that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b9614d597f8a985c38223ec710a02bf
https://doi.org/10.1007/978-3-662-48057-1_25
https://doi.org/10.1007/978-3-662-48057-1_25
Autor:
Sandra Kiefer, Joseph E. Smith
Publikováno v:
Enzyme. 14:76-81
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a487db26188ca94294764da8507346ea
https://doi.org/10.1159/000459464
https://doi.org/10.1159/000459464