| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650604 | Discrete Mathematics | 2008 | 17 Pages |
Abstract
We construct a combinatorial algorithm to find a maximum packing of fully node-disjoint non-returning A-paths.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gyula Pap,