Title of article
Priority-Consistent Graphs
Author/Authors
Farley، نويسنده , , Arthur M. and Proskurowski، نويسنده , , Andrzej، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
6
From page
521
To page
526
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.
Keywords
Priority , Algorithms , Permutations , graphs , trust
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454228
Link To Document