Results 1  10
of
296
Dense Subgraphs on Dynamic Networks
"... Abstract. In distributed networks, it is often useful for the nodes to be aware of dense subgraphs, e.g., such a dense subgraph could reveal dense subtructures in otherwise sparse graphs (e.g. the World Wide Web or social networks); these might reveal community clusters or dense regions for possibly ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. In distributed networks, it is often useful for the nodes to be aware of dense subgraphs, e.g., such a dense subgraph could reveal dense subtructures in otherwise sparse graphs (e.g. the World Wide Web or social networks); these might reveal community clusters or dense regions
Complexity of finding dense subgraphs
, 2002
"... The kf(k) dense subgraph problem((k; f(k))DSP) asks whether there is a kvertex subgraph of a given graph G which has at least f(k) edges. When f(k)=k(k − 1)=2, (k; f(k))DSP is equivalent to the wellknown kclique problem. The main purpose of this paper is to discuss the problem of nding slightl ..."
Abstract
 Add to MetaCart
The kf(k) dense subgraph problem((k; f(k))DSP) asks whether there is a kvertex subgraph of a given graph G which has at least f(k) edges. When f(k)=k(k − 1)=2, (k; f(k))DSP is equivalent to the wellknown kclique problem. The main purpose of this paper is to discuss the problem of nding
On finding dense subgraphs
 In ICALP ’09
, 2009
"... Abstract. Given an undirected graph G = (V, E), the density of a subgraph on vertex set S is defined as d(S) = E(S), where E(S) is the set of edges S in the subgraph induced by nodes in S. Finding subgraphs of maximum density is a very well studied problem. One can also generalize this notion t ..."
Abstract

Cited by 39 (2 self)
 Add to MetaCart
Abstract. Given an undirected graph G = (V, E), the density of a subgraph on vertex set S is defined as d(S) = E(S), where E(S) is the set of edges S in the subgraph induced by nodes in S. Finding subgraphs of maximum density is a very well studied problem. One can also generalize this notion
Criterions for locally dense subgraphs
"... Community detection is one of the most investigated problems in the field of complex networks. Although several methods were proposed, there is still no precise definition of communities. As a step towards a definition, I highlight two necessary properties of communities, separation and internal co ..."
Abstract
 Add to MetaCart
Community detection is one of the most investigated problems in the field of complex networks. Although several methods were proposed, there is still no precise definition of communities. As a step towards a definition, I highlight two necessary properties of communities, separation and internal cohesion, the latter being a new concept. I propose a local method of community detection based on twodimensional local optimization, which I tested on common benchmarks and on the word association database. 1
Fast Hierarchy Construction for Dense Subgraphs
"... ABSTRACT Discovering dense subgraphs and understanding the relations among them is a fundamental problem in graph mining. We want to not only identify dense subgraphs, but also build a hierarchy among them (e.g., larger but sparser subgraphs formed by two smaller dense subgraphs). Peeling algorithm ..."
Abstract
 Add to MetaCart
ABSTRACT Discovering dense subgraphs and understanding the relations among them is a fundamental problem in graph mining. We want to not only identify dense subgraphs, but also build a hierarchy among them (e.g., larger but sparser subgraphs formed by two smaller dense subgraphs). Peeling
Finding large and small dense subgraphs
 CoRR
"... We consider two optimization problems related to finding dense subgraphs, which are induced subgraphs with high average degree. The densest atleastksubgraph problem (DalkS) is to find an induced subgraph of highest average degree among all subgraphs with at least k vertices, and the densest atmo ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We consider two optimization problems related to finding dense subgraphs, which are induced subgraphs with high average degree. The densest atleastksubgraph problem (DalkS) is to find an induced subgraph of highest average degree among all subgraphs with at least k vertices, and the densest atmostksubgraph
Finding Dense Subgraphs with Mathematical Programming
, 1999
"... The Maximum Dispersion problem asks for a partition of a given graph into p vertexdisjoint sets, each of them having at most k vertices. The goal is to maximize the total edgeweight of the induced subgraphs. We present the first LPbased approximation algorithm. For the special case of computing a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
a single subgraph, the Heaviest Subgraph problem, we analyze a randomized algorithm which uses a semidefinite programming relaxation. Key Words. Approximation Algorithms, Randomized Algorithms, Semidefinite Programming, Maximum Dispersion, Dense Subgraphs 1 Introduction Let G = (V; E
A SURVEY OF ALGORITHMS FOR DENSE SUBGRAPH DISCOVERY
"... In this chapter, we present a survey of algorithms for dense subgraph discovery. The problem of dense subgraph discovery is closely related to clustering though the two problems also have a number of differences. For example, the problem of clustering is largely concerned with that of finding a fixe ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
In this chapter, we present a survey of algorithms for dense subgraph discovery. The problem of dense subgraph discovery is closely related to clustering though the two problems also have a number of differences. For example, the problem of clustering is largely concerned with that of finding a
Finding dense subgraphs of sparse graphs
 Proc. IPEC 2012 2012
"... Abstract. We investigate the computational complexity of the DensestkSubgraph (DkS) problem, where the input is an undirected graph G = (V, E) and one wants to find a subgraph on exactly k vertices with a maximum number of edges. We extend previous work on DkS by studying its parameterized complexi ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We investigate the computational complexity of the DensestkSubgraph (DkS) problem, where the input is an undirected graph G = (V, E) and one wants to find a subgraph on exactly k vertices with a maximum number of edges. We extend previous work on DkS by studying its parameterized
Results 1  10
of
296