A Fast Algorithm for Path 2-Packing Problem

From MaRDI portal

Revision as of 22:44, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3499768

Jump to:navigation, search

DOI10.1007/978-3-540-74510-5_10zbMath1188.05145OpenAlexW1837289809MaRDI 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

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

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

This page was built for publication: A Fast Algorithm for Path 2-Packing Problem

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