Sciweavers

1188 search results - page 134 / 238
» Extended Graph Unification
Sort
View
117
Voted
GD
2008
Springer
15 years 3 months ago
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
Seok-Hee Hong, Martin Mader
110
Voted
GG
2008
Springer
15 years 3 months ago
Parallel and Sequential Independence for Borrowed Contexts
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
Filippo Bonchi, Fabio Gadducci, Tobias Heindel
92
Voted
AUTOMATICA
2010
95views more  AUTOMATICA 2010»
15 years 2 months ago
Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks
In this paper we derive a set of constraints that are sufficient to guarantee maintained connectivity in a leader-follower multiagent network with proximity based communication to...
Tove Gustavi, Dimos V. Dimarogonas, Magnus Egerste...
137
Voted
INFORMATICALT
2008
93views more  INFORMATICALT 2008»
15 years 2 months ago
Viewcharts: Syntax and Semantics
In this paper, we present a method for describing the syntax and semantics of viewcharts. Viewcharts is a visual formalism for describing the dynamic behavior of system components....
Ayaz Isazadeh, Jaber Karimpour
EJC
2007
15 years 2 months ago
Link complexes of subspace arrangements
Abstract. Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced...
Axel Hultman