Path cover problems with length cost (Q2154120)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Path cover problems with length cost	scientific article

Statements

scholarly article

0 references

Path cover problems with length cost (English)

0 references

10.1007/978-3-030-96731-4_32

0 references

Kenya Kobayashi

0 references

0 references

0 references

0 references

Tadatoshi Utashima

0 references

Tsuyoshi Yagita

0 references

0 references

publication date

13 July 2022

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-96731-4_32

0 references

0 references

Complexity of Finding Embeddings in a <i>k</i>-Tree

0 references

Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph

0 references

A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem

0 references

0 references

On the \(k\)-path partition of graphs.

0 references

Nontrivial path covers of graphs: existence, minimization and maximization

0 references

A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two

0 references

On the Complexity of General Graph Factor Problems

0 references

Planar Formulae and Their Uses

0 references

The path partition problem and related problems in bipartite graphs

0 references

The existence of \(P_{\geq3}\)-factor covered graphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2154120

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2154120&oldid=36828526"