A linear k-forest is a graph whose components are paths with lengths at most k. The minimum number of linear k-forests needed to decompose a graph G is the linear k-arboricity of G and denoted by ...

This is a preview. Log in through your library . Abstract The modeling of traffic control systems for solving such problems as surface street signalization, dynamic traffic assignment, etc., typically ...