Tootfinder

Die @islieb #Osterpost ist angekommen 😍, der magnetische Teil hängt nun am Tiefkühler

Die @islieb #Osterpost ist angekommen 😍, der magnetische Teil hängt nun am Tiefkühler

This https://arxiv.org/abs/2309.05442 has been replaced.
link: https://scholar.google.com/scholar?q=a

Testing Spreading Behavior in Networks with Arbitrary Topologies
Inspired by the works of Goldreich and Ron (J. ACM, 2017) and Nakar and Ron (ICALP, 2021), we initiate the study of property testing in dynamic environments with arbitrary topologies. Our focus is on the simplest non-trivial rule that can be tested, which corresponds to the 1-BP rule of bootstrap percolation and models a simple spreading behavior: Every "infected" node stays infected forever, and each "healthy" node becomes infected if and only if it has at least one infected neighbor. We show …

This https://arxiv.org/abs/2303.07985 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

Logarithmic Weisfeiler--Leman and Treewidth
In this paper, we show that the $(3k+4)$-dimensional Weisfeiler--Leman algorithm can identify graphs of treewidth $k$ in $O(\log n)$ rounds. This improves the result of Grohe & Verbitsky (ICALP 2006), who previously established the analogous result for $(4k+3)$-dimensional Weisfeiler--Leman. In light of the equivalence between Weisfeiler--Leman and the logic $\textsf{FO} + \textsf{C}$ (Cai, Fürer, & Immerman, Combinatorica 1992), we obtain an improvement in the descriptive complexity for graph…

This https://arxiv.org/abs/2303.07985 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

Logarithmic Weisfeiler--Leman and Treewidth
In this paper, we show that the $(3k+4)$-dimensional Weisfeiler--Leman algorithm can identify graphs of treewidth $k$ in $O(\log n)$ rounds. This improves the result of Grohe & Verbitsky (ICALP 2006), who previously established the analogous result for $(4k+3)$-dimensional Weisfeiler--Leman. In light of the equivalence between Weisfeiler--Leman and the logic $\textsf{FO} + \textsf{C}$ (Cai, Fürer, & Immerman, Combinatorica 1992), we obtain an improvement in the descriptive complexity for graph…

Frühlingsfrisch.
.
.
.
.
#moin #runneroderrentner #ichlaufeausversehenundnichtwieandereweilsiemüssen

Frühlingsfrisch.
.
.
.
.
#moin #runneroderrentner #ichlaufeausversehenundnichtwieandereweilsiemüssen

Mist! Jetzt erst gesehen!
via @…
https://mastodon.social/@islieb/111835800200587212

Decline and Fall of the ICALP 2008 Modular Decomposition algorithm
William Atherton, Dmitrii V. Pasechnik
https://arxiv.org/abs/2404.14049 https://<…

Decline and Fall of the ICALP 2008 Modular Decomposition algorithm
We provide a counterexample to a crucial lemma in the ICALP 2008 paper "Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations", invalidating the algorithm described there.

Mist! Jetzt erst gesehen!
via @…
https://mastodon.social/@islieb/111835800200587212