2473 search results - page 230 / 495 » The Logic of Communication Graphs |
168
click to vote
TACAS
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
126
click to vote
GD
2004
Springer
16 years 1 days ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
174
click to vote
ISCAS
2003
IEEE
15 years 12 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...
194
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...
166
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...