Sciweavers

1493 search results - page 144 / 299
» Local resilience of graphs
Sort
View
CGF
2010
169views more  CGF 2010»
13 years 8 months ago
Image-Based Edge Bundles: Simplified Visualization of Large Graphs
We present a new approach aimed at understanding the structure of connections in edge-bundling layouts. We combine the advantages of edge bundles with a bundle-centric simplified ...
Alexandru Telea, Ozan Ersoy
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 8 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi
ICTAI
2010
IEEE
13 years 6 months ago
An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
Una Benlic, Jin-Kao Hao
ICDAR
2009
IEEE
13 years 5 months ago
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
Pierre Le Bodic, Hervé Locteau, Séba...
TVCG
2011
171views more  TVCG 2011»
13 years 2 months ago
Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs
—In this paper, we present the results of a human computer interaction experiment that compared the performance of the animation of dynamic graphs to the presentation of small mu...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...