Sciweavers

2612 search results - page 218 / 523
» Assemblies as Graph Processes
Sort
View
DCOSS
2008
Springer
15 years 8 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 6 months ago
Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
Julian John McAuley, Tibério S. Caetano, Ma...
TVCG
2008
145views more  TVCG 2008»
15 years 6 months ago
Geometry-Based Edge Clustering for Graph Visualization
Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In thi...
Weiwei Cui, Hong Zhou, Huamin Qu, Pak Chung Wong, ...
JOT
2010
216views more  JOT 2010»
15 years 5 months ago
A UML and Colored Petri Nets Integrated Modeling and Analysis Approach using Graph Transformation
Nowadays, UML is considered to be the standardized language for object-oriented modeling and analysis. However, UML cannot be used for automatic analyses and simulation. In this pa...
Elhillali Kerkouche, Allaoua Chaoui, El Bay Bouren...
COMBINATORICA
2010
15 years 4 months ago
Online vertex-coloring games in random graphs
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
Martin Marciniszyn, Reto Spöhel