Sciweavers

534 search results - page 56 / 107
» Diameter critical graphs
Sort
View
72
Voted
ECAL
2003
Springer
15 years 4 months ago
Visualizing Evolutionary Dynamics of Self-Replicators Using Graph-Based Genealogy
We present a general method for evaluating and visualizing evolutionary dynamics of self-replicators using a graph-based representation for genealogy. Through a transformation from...
Chris Salzberg, Antony Antony, Hiroki Sayama
CVPR
2012
IEEE
13 years 1 months ago
Non-negative low rank and sparse graph for semi-supervised learning
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
15 years 11 months ago
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and m...
Sitaram Asur, Srinivasan Parthasarathy, Duygu Ucar
ICCV
2003
IEEE
15 years 4 months ago
Edit Distance From Graph Spectra
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
Antonio Robles-Kelly, Edwin R. Hancock
RSA
2011
124views more  RSA 2011»
14 years 6 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...