Sciweavers

821 search results - page 6 / 165
» Addressing the Petersen graph
Sort
View
ESANN
2008
14 years 11 months ago
Self-Organizing Maps for cyclic and unbounded graphs
Abstract. This paper introduces a new concept to the processing of graph structured information using self organising map framework. Previous approaches to this problem were limite...
Markus Hagenbuchner, Alessandro Sperduti, Ah Chung...
NIPS
2003
14 years 11 months ago
Denoising and Untangling Graphs Using Degree Priors
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...
Quaid Morris, Brendan J. Frey
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 4 months ago
Random Walk on Directed Dynamic Graphs
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
Oksana Denysyuk, Luis Rodrigues
ACSC
2005
IEEE
15 years 3 months ago
A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
Xiaodi Huang, Peter Eades, Wei Lai
ICSM
2003
IEEE
15 years 2 months ago
On Modeling Software Architecture Recovery as Graph Matching
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both ...
Kamran Sartipi, Kostas Kontogiannis