The path set packing problem

DOI10.1007/978-3-319-94776-1_26OpenAlexW2809773377MaRDI QIDQ1790987

Chenyang Xu, Guo-Chuan Zhang

Publication date: 4 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94776-1_26

zbMATH Keywords

parameterized algorithmmaximum number of edge-disjoint paths

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

An evolutionary algorithm based hyper-heuristic framework for the set packing problem ⋮ Parameterized complexity of path set packing

This page was built for publication: The path set packing problem