13 search results - page 3 / 3 » Computing Role Assignments of Chordal Graphs |
89
Voted
CSR
2008
Springer
15 years 1 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
101
click to vote
AAAI
2007
15 years 2 months ago
2007
bstract or nonliving entities act or are described as living. And living things gain extra benefits such as animals talking. For this reason, the standard scripts are modified to a...
112
click to vote
WIOPT
2006
IEEE
15 years 5 months ago
2006
IEEE
— This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...