Sciweavers

2612 search results - page 221 / 523
» Assemblies as Graph Processes
Sort
View
GD
2008
Springer
15 years 7 months ago
Cyclic Leveling of Directed Graphs
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
PVLDB
2010
112views more  PVLDB 2010»
15 years 5 months ago
On Triangulation-based Dense Neighborhood Graphs Discovery
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
Nan Wang, Jingbo Zhang, Kian-Lee Tan, Anthony K. H...
ICDAR
2009
IEEE
15 years 4 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...
MEMICS
2010
15 years 1 months ago
A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
Ondrej Danek, Martin Maska
APVIS
2011
14 years 6 months ago
Multilevel agglomerative edge bundling for visualizing large graphs
Graphs are often used to encapsulate relationships between objects. Node-link diagrams, commonly used to visualize graphs, suffer from visual clutter on large graphs. Edge bundlin...
Emden R. Gansner, Yifan Hu, Stephen C. North, Carl...