Results 21 to 30 of about 1,490 (139)

A polynomial excluded-minor approximation of treedepth [PDF]

Journal of the European Mathematical Society, 2018
Treedepth is a minor-monotone graph invariant in the family of “width measures” that includes treewidth and pathwidth. The characterization and approximation of these invariants in terms of excluded minors has been a topic of interest in the study of sparse graphs.
Kawarabayashi, Ken-Ichi, Rossman, Benjamin   +1 more
openaire   +2 more sources

Parameterized Algorithms for MILPs with Small Treedepth

Proceedings of the AAAI Conference on Artificial Intelligence, 2021
Solving (mixed) integer (linear) programs, (M)I(L)Ps for short, is a fundamental optimisation task with a wide range of applications in artificial intelligence and computer science in general. While hard in general, recent years have brought about vast progress for solving structurally restricted, (non-mixed) ILPs: n-fold, tree-fold, 2-stage stochastic
Brand, Cornelius, Koutecký, Martin, Ordyniak, Sebastian   +2 more
openaire   +2 more sources

Modulating verbal working memory with fronto‐parietal transcranial electric stimulation at theta frequency: Does it work?

European Journal of Neuroscience, Volume 55, Issue 2, Page 405-425, January 2022., 2022
We used multi‐site transcranial alternating stimulation at theta frequency to either synchronize or desynchronize a fronto‐parietal working memory network in order to modulate verbal working memory performance. Results indicate that a behavioural modulatory effect of synchronizing fronto‐parietal tACS can only be observed in a working memory task of ...
Anna Lena Biel, Elisabeth Sterner, Lukas Röll, Paul Sauseng   +3 more
wiley   +1 more source

Integer Programming and Incidence Treedepth [PDF]

, 2019
Recently a strong connection has been shown between the tractability of integer programming (IP) with bounded coefficients on the one side and the structure of its constraint matrix on the other side. To that end, integer linear programming is fixed-parameter tractable with respect to the primal (or dual) treedepth of the Gaifman graph of its ...
Eiben, E, Ganian, R, Knop, D, Ordyniak, S, Pilipczuk, M, Wrochna, M   +5 more
openaire   +3 more sources

The significance of structural rich club hubs for the processing of hierarchical stimuli. [PDF]

Hum Brain Mapp
We collected functional magnetic resonance imaging data during presentation of hierarchically structured stimuli, and diffusion weighted imaging data to identify the hierarchical rich club architecture in the same subjects. Integrating functional and structural data revealed an anterior‐medial frontal shift and engagement of rich club hubs for ...
Mecklenbrauck F, Gruber M, Siestrup S, Zahedi A, Grotegerd D, Mauritz M, Trempler I, Dannlowski U, Schubotz RI.   +8 more
europepmc   +2 more sources

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem [PDF]

Discrete Mathematics & Theoretical Computer Science
In this work, we study the Biclique-Free Vertex Deletion problem: Given a graph $G$ and integers $k$ and $i \le j$, find a set of at most $k$ vertices that intersects every (not necessarily induced) biclique $K_{i, j}$ in $G$.
Lito Goldmann, Leon Kellerhals, Tomohiro Koana   +2 more
doaj   +1 more source

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability [PDF]

, 2016
In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover cost.
D Gozupek, D Gözüpek, D Gözüpek, E Amaldi, E Kim, G Galbiati, G Galbiati, G Galbiati, H-C Wirth, J Flum, K Pietrzak, L Gourvès, M Berg de, M Cygan, P Wollan, R Ganian, R Niedermeier, RG Downey, S Arkoulis   +18 more
core   +2 more sources

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space [PDF]

SIAM Journal on Discrete Mathematics, 2020
Presented at WG2020.
Jesper Nederlof, Michał Pilipczuk, Céline M. F. Swennenhuis, Karol Węgrzycki   +3 more
openaire   +7 more sources

Circumference and Pathwidth of Highly Connected Graphs [PDF]

, 2014
Birmele [J. Graph Theory, 2003] proved that every graph with circumference t has treewidth at most t-1. Under the additional assumption of 2-connectivity, such graphs have bounded pathwidth, which is a qualitatively stronger result. Birmele's theorem was
Marshall, Emily A., Wood, David R.
core   +1 more source

On Routing Disjoint Paths in Bounded Treewidth Graphs [PDF]

, 2015
We study the problem of routing on disjoint paths in bounded treewidth graphs with both edge and node capacities. The input consists of a capacitated graph $G$ and a collection of $k$ source-destination pairs $\mathcal{M} = \{(s_1, t_1), \dots, (s_k, t_k)
Ene, Alina, Mnich, Matthias, Pilipczuk, Marcin, Risteski, Andrej   +3 more
core   +2 more sources