Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Rocton, Mathis"'
We study the well-established problem of finding an optimal routing of unsplittable flows in a graph. While by now there is an extensive body of work targeting the problem on graph classes such as paths and trees, we aim at using the parameterized pa
Externí odkaz:
http://arxiv.org/abs/2410.16964
Given a digraph, an ordering of its vertices defines a backedge graph, namely the undirected graph whose edges correspond to the arcs pointing backwards with respect to the order. The degreewidth of a digraph is the minimum over all ordering of the m
Externí odkaz:
http://arxiv.org/abs/2407.19270
The approximate computation of twin-width has attracted significant attention already since the moment the parameter was introduced. A recently proposed approach (STACS 2024) towards obtaining a better understanding of this question is to consider th
Externí odkaz:
http://arxiv.org/abs/2407.15514
The problem of whether and how one can compute the twin-width of a graph -- along with an accompanying contraction sequence -- lies at the forefront of the area of algorithmic model theory. While significant effort has been aimed at obtaining a fixed
Externí odkaz:
http://arxiv.org/abs/2310.08243
We consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph $G = (V,E)$ and an integer $k \in \mathbb{N}$ and seeks to edit (add or delete) at most $k$ edges from $G$ to obtain a block grap
Externí odkaz:
http://arxiv.org/abs/2201.13140
We consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph $G = (V,E)$ and an integer $k \in \mathbb{N}$ and seeks to edit (add or delete) at most $k$ edges from $G$ to obtain a block grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3a4d25694798b12e05ee6389350d03f
http://arxiv.org/abs/2201.13140
http://arxiv.org/abs/2201.13140
Autor:
Bathie, Gabriel, Berthe, Gaétan, Coudert-Osmont, Yoann, Desobry, David, Reinald, Amadeus, Rocton, Mathis
Publikováno v:
Leibniz International Proceedings in Informatics
Leibniz International Proceedings in Informatics, 2022, ⟨10.4230/LIPIcs.IPEC.2022.31⟩
Leibniz International Proceedings in Informatics, 2022, ⟨10.4230/LIPIcs.IPEC.2022.31⟩
We describe DreyFVS, a heuristic for Directed Feedback Vertex Set submitted to the 2022 edition of Parameterized Algorithms and Computational Experiments Challenge. The Directed Feedback Vertex Set problem asks to remove a minimal number of vertices
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8a9319f9873064bfcc91ccf362aba4cf