Sciweavers

3008 search results - page 145 / 602
» Independence in connected graphs
Sort
View
CGF
2010
118views more  CGF 2010»
15 years 6 months ago
The Readability of Path-Preserving Clusterings of Graphs
Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving wa...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...
JMLR
2011
145views more  JMLR 2011»
15 years 1 months ago
Cumulative Distribution Networks and the Derivative-sum-product Algorithm: Models and Inference for Cumulative Distribution Func
We present a class of graphical models for directly representing the joint cumulative distribution function (CDF) of many random variables, called cumulative distribution networks...
Jim C. Huang, Brendan J. Frey
CEC
2005
IEEE
15 years 8 months ago
Graph composition in a graph grammar-based method for automata network evolution
The dynamics of neural and other automata networks are defined to a large extent by their topologies. Artificial evolution constitutes a practical means by which an optimal topolog...
Martin H. Luerssen, David M. W. Powers
ACSC
2007
IEEE
16 years 24 days ago
From Graphs to Euclidean Virtual Worlds: Visualization of 3D Electronic Institutions
In this paper we propose an algorithm for automatic transformation of a graph into a 3D Virtual World and its Euclidean map, using the rectangular dualization technique. The nodes...
Sara Drago, Anton Bogdanovych, Massimo Ancona, Sim...
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
16 years 17 days ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul