Sciweavers

1093 search results - page 119 / 219
» Clustering from Constraint Graphs
Sort
View
130
Voted
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
15 years 7 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...
111
Voted
ACSD
2005
IEEE
126views Hardware» more  ACSD 2005»
15 years 9 months ago
Modelling and Analysis of Distributed Simulation Protocols with Distributed Graph Transformation
This paper presents our approach to model distributed discrete event simulation systems in the framework of distributed graph transformation. We use distributed typed attributed g...
Juan de Lara, Gabriele Taentzer
135
Voted
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
15 years 9 months ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
André Berger, Artur Czumaj, Michelangelo Gr...
VL
2009
IEEE
187views Visual Languages» more  VL 2009»
15 years 10 months ago
Changing euler diagram properties by edge transformation of euler dual graphs
Euler diagrams form the basis of several visual modelling notations, including statecharts and constraint diagrams. Recently, various techniques for automated Euler diagram drawin...
John Howse, Peter Rodgers, Gem Stapleton
143
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
A Graph-Based Model for Disconnected Ad Hoc Networks
— Recently, research on disconnected networks has been fostered by several studies on delay-tolerant networks, which are designed in order to sustain disconnected operations. We ...
Francesco De Pellegrini, Daniele Miorandi, Iacopo ...