Path cover problems with length cost
From MaRDI portal
Publication:2154120
DOI10.1007/978-3-030-96731-4_32OpenAlexW4226144954MaRDI QIDQ2154120
Toshiki Saitoh, Tsuyoshi Yagita, Tadatoshi Utashima, Eiji Miyano, Kenya Kobayashi, Akira Suzuki, Guo-Hui Lin
Publication date: 13 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-96731-4_32
Cites Work
- Unnamed Item
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- On the \(k\)-path partition of graphs.
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- Nontrivial path covers of graphs: existence, minimization and maximization
- A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem
- The existence of \(P_{\geq3}\)-factor covered graphs
- The path partition problem and related problems in bipartite graphs
- On the Complexity of General Graph Factor Problems
- Complexity of Finding Embeddings in a k-Tree
- Planar Formulae and Their Uses
This page was built for publication: Path cover problems with length cost
