Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Marcelo Garlet Millani"'
Autor:
Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier, Robert Bredereck, Vincent Froese, Marcel Koseler
Publikováno v:
Algorithmica. 81:1584-1614
There has been intensive work on the parameterized complexity of the typically NP-hard task to edit undirected graphs into graphs fulfilling certain given vertex degree constraints. In this work, we lift the investigations to the case of directed gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7ca5710f46e4fac979c8287313bde15
https://doi.org/10.1007/s00453-018-0494-6
https://doi.org/10.1007/s00453-018-0494-6
Publikováno v:
The Electronic Journal of Combinatorics, 29 (4)
A colouring of a digraph as defined by Neumann-Lara in 1982 is a vertex-colouring such that no monochromatic directed cycles exist. The minimal number of colours required for such a colouring of a loopless digraph is defined to be its dichromatic num
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4062d0738f94e45765c726604e4d02a5
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319961507
ISCO
ISCO
Funnels are a new natural subclass of DAGs. Intuitively, a DAG is a funnel if every source-sink path can be uniquely identified by one of its arcs. Funnels are an analog to trees for directed graphs that is more restrictive than DAGs but more express
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f38d249a3128fa966f2f93eec50666df
https://doi.org/10.1007/978-3-319-96151-4_16
https://doi.org/10.1007/978-3-319-96151-4_16