Results 1  10
of
2,073
Complex networks: Structure and dynamics
, 2006
"... Coupled biological and chemical systems, neural networks, social interacting species, the Internet and the World Wide Web, are only a few examples of systems composed by a large number of highly interconnected dynamical units. The first approach to capture the global properties of such systems is t ..."
Abstract

Cited by 435 (12 self)
 Add to MetaCart
is to model them as graphs whose nodes represent the dynamical units, and whose links stand for the interactions between them. On the one hand, scientists have to cope with structural issues, such as characterizing the topology of a complex wiring architecture, revealing the unifying principles
Clique Partitions, Graph Compression and Speedingup Algorithms
 Journal of Computer and System Sciences
, 1991
"... We first consider the problem of partitioning the edges of a graph G into bipartite cliques such that the total order of the cliques is minimized, where the order of a clique is the number of vertices in it. It is shown that the problem is NPcomplete. We then prove the existence of a partition of s ..."
Abstract

Cited by 88 (3 self)
 Add to MetaCart
on graph partitioning to efficiently compute an optimal compression for graphs of a given size. An interesting application of the graph compression result arises from the fact that several graph algorithms can be adapted to work with the compressed representation of the input graph, thereby improving
SimRank: A Measure of StructuralContext Similarity
 In KDD
, 2002
"... The problem of measuring "similarity" of objects arises in many applications, and many domainspecific measures have been developed, e.g., matching text across documents or computing overlap among itemsets. We propose a complementary approach, applicable in any domain with objectto ..."
Abstract

Cited by 387 (3 self)
 Add to MetaCart
Rank, is based on a simple and intuitive graphtheoretic model. For a given domain, SimRank can be combined with other domainspecific similarity measures. We suggest techniques for efficient computation of SimRank scores, and provide experimental results on two application domains showing the computational
Stochastic Models for the Web Graph
, 2000
"... The web may be viewed as a directed graph each of whose vertices is a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to another. In this paper we propose and analyze random graph models inspired by a series of empirical observations on the web. Our graph m ..."
Abstract

Cited by 291 (12 self)
 Add to MetaCart
models differ from the traditional Gn;p models in two ways: 1. Independently chosen edges do not result in the statistics (degree distributions, clique multitudes) observed on the web. Thus, edges in our model are statistically dependent on each other. 2. Our model introduces new vertices in the graph
Spectral segmentation with multiscale graph decomposition
 In CVPR
, 2005
"... We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, without iteration, to capture both coarse and fine level details. The algorithm is computationally efficient, allowing to ..."
Abstract

Cited by 185 (3 self)
 Add to MetaCart
to segment large images. We use the Normalized Cut graph partitioning framework of image segmentation. We construct a graph encoding pairwise pixel affinity, and partition the graph for image segmentation. We demonstrate that large image graphs can be compressed into multiple scales capturing image structure
On a Recurrence Arising in Graph Compression
, 2011
"... In a recently proposed graphical compression algorithm [1], the following tree arose in the course of the analysis. The root contains n balls that are consequently distributed betweentwosubtreesaccordingtoasimplerule: Ineachstep, allballsindependentlymove down to the left subtree (say with probabili ..."
Abstract
 Add to MetaCart
In a recently proposed graphical compression algorithm [1], the following tree arose in the course of the analysis. The root contains n balls that are consequently distributed betweentwosubtreesaccordingtoasimplerule: Ineachstep, allballsindependentlymove down to the left subtree (say
Compressing the graph structure of the Web
 Proceedings of the Data Compression Conference (DCC), Snowbird, UT
, 2001
"... Abstract A large amount of research has recently focused on the graph structure (or link structure) of the World Wide Web. This structure has proven to be extremely useful for improving the performance of search engines and other tools for navigating the web. However, since the graphs in these scen ..."
Abstract

Cited by 57 (2 self)
 Add to MetaCart
for compressing the graph structure of the web, and give experimental results of a prototype implementation. We attempt to exploit a variety of different sources of compressibility of these graphs and of the associated set of URLs in order to obtain good compression performance on a large web graph.
Regularization and semisupervised learning on large graphs
 In COLT
, 2004
"... Abstract. We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition in manifold settings. It is also of potential practical importance, when the data is abundant, but labeling i ..."
Abstract

Cited by 148 (1 self)
 Add to MetaCart
Abstract. We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition in manifold settings. It is also of potential practical importance, when the data is abundant, but labeling
Graph problems arising from wavelengthrouting in alloptical networks
, 1997
"... We survey the theoretical results obtained for wavelength routing in all–optical networks, present some new results and propose several open problems. In all–optical networks the vast bandwidth available is utilized through wavelength division multiplexing: a single physical optical link can carry s ..."
Abstract

Cited by 84 (20 self)
 Add to MetaCart
We survey the theoretical results obtained for wavelength routing in all–optical networks, present some new results and propose several open problems. In all–optical networks the vast bandwidth available is utilized through wavelength division multiplexing: a single physical optical link can carry
Heuristically optimized tradeoffs: a new paradigm for power laws in the internet
, 2002
"... Abstract We give a plausible explanation of the power law distributions of degrees observed in the graphs arising in the Internet topology [5] based on a toy model of Internet growth in which two objectives are optimized simultaneously: "last mile " connection costs, and transmissi ..."
Abstract

Cited by 178 (1 self)
 Add to MetaCart
Abstract We give a plausible explanation of the power law distributions of degrees observed in the graphs arising in the Internet topology [5] based on a toy model of Internet growth in which two objectives are optimized simultaneously: "last mile " connection costs
Results 1  10
of
2,073