A Fast Algorithm for Path 2-Packing Problem

DOI10.1007/978-3-540-74510-5_10zbMath1188.05145MaRDI QIDQ3499768

Maxim A. Babenko

Publication date: 3 June 2008

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74510-5_10

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

A fast algorithm for the path 2-packing problem, A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem