13 search results - page 3 / 3 » Acyclic and Frugal Colourings of Graphs |
ENDM
2007
13 years 7 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
SBACPAD
2003
IEEE
14 years 24 days ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due ...