1528 search results - page 153 / 306 » On Signatures for Communication Graphs |
168
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
174
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students. We show...
162
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
186
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
194
click to vote
SPE
2008
15 years 6 months ago
2008
composed of various graphs linked together by relations of abstraction/refinement. The new structure is useful for representing information that can be described at t levels of abs...