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 ...
Linear Circuit Transfer Functions: An Introduction to Fast Analytical Techniques, Christophe P. Basso, Wiley, IEEE Press (www.wiley.com), ISBN: 978 111 923 637 5, glossy hardback, 445 numbered pages, ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback