Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Cochefert, Manfred"'
Autor:
Cochefert, Manfred, Couturier, Jean-François, Golovach, Petr A., Kratsch, Dieter, Paulusma, Daniël, Stewart, Anthony
A graph H is a square root of a graph G if G can be obtained from H by adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of deciding whether a given graph admits a square root. This problem is only k
Externí odkaz:
http://arxiv.org/abs/1608.06142
A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversals of a hypergraph. For each fixed k>2, our algorithms for hypergraphs
Externí odkaz:
http://arxiv.org/abs/1510.05093
Autor:
Cochefert, Manfred, Couturier, Jean-François, Golovach, Petr A., Kratsch, Dieter, Paulusma, Daniël
We show that the following two problems are fixed-parameter tractable with parameter k: testing whether a connected n-vertex graph with m edges has a square root with at most n-1+k edges and testing whether such a graph has a square root with at leas
Externí odkaz:
http://arxiv.org/abs/1310.5469
Autor:
Chapelle, Mathieu, Cochefert, Manfred, Couturier, Jean-Fraņcois, Kratsch, Dieter, Letourneur, Romain, Liedloff, Mathieu, Perez, Anthony
Publikováno v:
In Discrete Applied Mathematics 30 October 2018 248:79-92
Autor:
Cochefert, Manfred, Couturier, Jean-François, Golovach, Petr A., Kratsch, Dieter, Paulusma, Daniël, Stewart, Anthony
Publikováno v:
In Discrete Applied Mathematics 30 October 2018 248:93-101
Autor:
Chapelle, Mathieu, Cochefert, Manfred, Kratsch, Dieter, Letourneur, Romain, Liedloff, Mathieu
Publikováno v:
In Theoretical Computer Science 9 May 2017 676:33-41
Autor:
Cochefert, Manfred
Dans cette thèse, nous nous intéressons à la résolution exacte de problèmes NP-difficiles sur les graphes et les hypergraphes. Les problèmes que nous étudions regroupent dans un premier temps des variantes du problème classique du nombre chro
Externí odkaz:
http://www.theses.fr/2014LORR0336/document
Autor:
Cochefert, Manfred
In this thesis, we are interested in the exact computation of np-hard problems on graphs and hypergraphs. Firstly, we study several variants of colorings. Those variants appear harder than the famous chromatic number problem, by adding difficulty in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______166::6027ea3bc03556a00e18d22ba15b4d6f
https://hal.univ-lorraine.fr/tel-01751574
https://hal.univ-lorraine.fr/tel-01751574
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
LATIN 2016: Theoretical Informatics; 2016, p306-318, 13p