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
The complexity of packing edge-disjoint paths - MaRDI portal

The complexity of packing edge-disjoint paths

From MaRDI portal

Publication:5875542

Jump to:navigation, search

DOI10.4230/LIPIcs.IPEC.2019.10OpenAlexW2996181449MaRDI QIDQ5875542

Jan Dreier, Philipp Kuinke, Janosch Fuchs, Hung-Lung Wang, Bjoern Tauer, Tim A. Hartmann, Peter Rossmanith

Publication date: 3 February 2023

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

zbMATH Keywords

covering embedding packing Hamiltonian path parameterized complexity path-perfect graphs unary binpacking

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Geodesic packing in graphs

This page was built for publication: The complexity of packing edge-disjoint paths

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