| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9514610 | Electronic Notes in Discrete Mathematics | 2005 | 6 Pages |
Abstract
We introduce the notion of minimum size graphs in which stated priorities are reflected by shortest-path distances. We present initial results giving some general properties of such graphs and an efficient algorithm to determine whether a graph consistent with given priorities is a tree.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Arthur M. Farley, Andrzej Proskurowski,