Sciweavers

4865 search results - page 174 / 973
» The Complexity of Graph Connectivity
Sort
View
112
Voted
DSS
2006
93views more  DSS 2006»
15 years 3 months ago
Merging workflows: A new perspective on connecting business processes
This paper describes the concept of workflow merge and methods for merging business processes. We grouped merges in four categories according to the type of merge: sequential, par...
Shuang Sun, Akhil Kumar, John Yen
204
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
Scalable and fully distributed localization with mere connectivity
Abstract—This work proposes a novel connectivity-based localization algorithm, well suitable for large-scale sensor networks with complex shapes and non-uniform nodal distributio...
Miao Jin, Su Xia, Hongyi Wu, Xianfeng Gu
156
Voted
ICST
2010
IEEE
15 years 1 months ago
GraphSeq: A Graph Matching Tool for the Extraction of Mobility Patterns
Mobile computing systems provide new challenges for verification. One of them is the dynamicity of the system structure, with mobility-induced connections and disconnections, dynam...
Minh Duc Nguyen, Hélène Waeselynck, ...
137
Voted
CGF
2010
118views more  CGF 2010»
15 years 3 months ago
The Readability of Path-Preserving Clusterings of Graphs
Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving wa...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...
CEC
2005
IEEE
15 years 5 months ago
Graph composition in a graph grammar-based method for automata network evolution
The dynamics of neural and other automata networks are defined to a large extent by their topologies. Artificial evolution constitutes a practical means by which an optimal topolog...
Martin H. Luerssen, David M. W. Powers