Sciweavers

689 search results - page 75 / 138
» A Modal-Logic Based Graph Abstraction
Sort
View
FMCO
2005
Springer
101views Formal Methods» more  FMCO 2005»
14 years 1 months ago
Synchronised Hyperedge Replacement as a Model for Service Oriented Computing
Abstract. This tutorial paper describes a framework for modelling several aspects of distributed computing based on Synchronised Hyperedge Replacement (SHR), a graph rewriting form...
Gian Luigi Ferrari, Dan Hirsch, Ivan Lanese, Ugo M...
GD
2003
Springer
14 years 26 days ago
The Puzzle Layout Problem
We address the new problem of puzzle layout as a new application of awing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled a...
Kozo Sugiyama, Seok-Hee Hong, Atsuhiko Maeda
GD
1998
Springer
13 years 12 months ago
Improved Force-Directed Layouts
Abstract. Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected gr...
Emden R. Gansner, Stephen C. North
BIRD
2008
Springer
163views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
Multi-functional Protein Clustering in PPI Networks
Abstract. Protein-Protein Interaction (PPI) networks contain valuable information for the isolation of groups of proteins that participate in the same biological function. Many pro...
Clara Pizzuti, Simona E. Rombo
DGCI
2008
Springer
13 years 9 months ago
On Watershed Cuts and Thinnings
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...