Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Graph Motif Problems Parameterized by Dual - MaRDI portal

Graph Motif Problems Parameterized by Dual

From MaRDI portal

Publication:5369540

Jump to:navigation, search

DOI10.4230/LIPIcs.CPM.2016.7zbMath1382.68106arXiv1908.03870MaRDI QIDQ5369540

Christian Komusiewicz, Guillaume Fertin

Publication date: 17 October 2017

Full work available at URL: https://arxiv.org/abs/1908.03870

zbMATH Keywords

lower bounds NP-hard problem kernelization fixed-parameter algorithm subgraph problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? ⋮ Algorithmic Aspects of the Maximum Colorful Arborescence Problem ⋮ The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph

This page was built for publication: Graph Motif Problems Parameterized by Dual

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5369540&oldid=20081403"