Book ChapterDOI
Greedy approximation algorithms for finding dense components in a graph
Reads0
Chats0
TLDR
This paper gives simple greedy approximation algorithms for these optimization problems of finding subgraphs maximizing these notions of density for undirected and directed graphs and answers an open question about the complexity of the optimization problem for directed graphs.Abstract:
We study the problem of finding highly connected subgraphs of undirected and directed graphs. For undirected graphs, the notion of density of a subgraph we use is the average degree of the subgraph. For directed graphs, a corresponding notion of density was introduced recently by Kannan and Vinay. This is designed to quantify highly connectedness of substructures in a sparse directed graph such as the web graph. We study the optimization problems of finding subgraphs maximizing these notions of density for undirected and directed graphs. This paper gives simple greedy approximation algorithms for these optimization problems. We also answer an open question about the complexity of the optimization problem for directed graphs.read more
Citations
More filters
Proceedings ArticleDOI
Real-time, Scalable, Content-based Twitter Users Recommendation
TL;DR: This paper presents a scalable approach that allows real time recommendation of users based on their tweets, and shows how this model can be encoded as a compact binary footprint, that allows very fast comparison and ranking, taking full advantage of modern CPU architectures.
Journal ArticleDOI
Span-core Decomposition for Temporal Networks: Algorithms and Applications
Edoardo Galimberti,Martino Ciaperoni,Alain Barrat,Francesco Bonchi,Ciro Cattuto,Francesco Gullo +5 more
TL;DR: This article introduces a notion of temporal core decomposition where each core is associated with two quantities, its coreness, which quantifies how densely it is connected, and its span, which is a temporal interval: it derives a connection between this problem and the problem of finding (maximal) span-cores and shows how temporal community search can be solved in polynomial-time via dynamic programming.
Book ChapterDOI
A Graph-Based Approach for Image Segmentation
TL;DR: A comparison with the well known graph clustering method of normalized cuts shows that the proposed approach is faster and produces segmentations that are in better agreement with visual assessment on original images.
Book ChapterDOI
Efficient Search of the Most Cohesive Co-located Community in Attributed Networks
TL;DR: This paper proposes an index structure called \(\textsc {D}k\textsc{Q-tree}\) to integrate the spatial information and the local structure information together to accelerate the query processing and develops two efficient algorithms.
Proceedings ArticleDOI
Metric Sublinear Algorithms via Linear Sampling
TL;DR: This work presents a sampling approach for such metric graphs that, using a sublinear number of edge weight queries, provides a linear sampling, where each edge is sampled proportionally to its weight.
References
More filters
Proceedings ArticleDOI
Authoritative sources in a hyperlinked environment
TL;DR: This work proposes and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of \hub pages that join them together in the link structure, that has connections to the eigenvectors of certain matrices associated with the link graph.
Journal ArticleDOI
Trawling the Web for emerging cyber-communities
TL;DR: The subject of this paper is the systematic enumeration of over 100,000 emerging communities from a Web crawl, motivating a graph-theoretic approach to locating such communities, and describing the algorithms and algorithmic engineering necessary to find structures that subscribe to this notion.
Book ChapterDOI
The web as a graph: measurements, models, and methods
TL;DR: This paper describes two algorithms that operate on the Web graph, addressing problems from Web search and automatic community discovery, and proposes a new family of random graph models that point to a rich new sub-field of the study of random graphs, and raises questions about the analysis of graph algorithms on the Internet.
Proceedings ArticleDOI
Inferring Web communities from link topology
TL;DR: This investigation shows that although the process by which users of the Web create pages and links is very difficult to understand at a “local” level, it results in a much greater degree of orderly high-level structure than has typically been assumed.