Results 1  10
of
882
Exact and approximation algorithms for densest ksubgraph
, 2012
"... The densest ksubgraph problem is a generalization of the maximum clique problem, in which we are given a graph G and a positive integer k, and we search among the subsets of k vertices of G one inducing a maximum number of edges. In this paper, we present algorithms for finding exact solutions of d ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
The densest ksubgraph problem is a generalization of the maximum clique problem, in which we are given a graph G and a positive integer k, and we search among the subsets of k vertices of G one inducing a maximum number of edges. In this paper, we present algorithms for finding exact solutions
Densest kSubgraph Approximation on Intersection Graphs
"... Abstract. We study approximation solutions for the densest ksubgraph problem (DSk) on several classes of intersection graphs. We adopt the concept of σquasi elimination orders, introduced by Akcoglu et al. [1], generalizing the perfect elimination orders for chordal graphs, and develop a simple O ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We study approximation solutions for the densest ksubgraph problem (DSk) on several classes of intersection graphs. We adopt the concept of σquasi elimination orders, introduced by Akcoglu et al. [1], generalizing the perfect elimination orders for chordal graphs, and develop a simple
Densest Subgraph in Streaming and MapReduce
"... The problem of finding locally dense components of a graph is an important primitive in data analysis, with wideranging applications from community mining to spam detection and the discovery of biological network modules. In this paper we present new algorithms for finding the densest subgraph in t ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wideranging applications from community mining to spam detection and the discovery of biological network modules. In this paper we present new algorithms for finding the densest subgraph
The densest ksubgraph problem on clique graphs
 IN INTERNATIONAL COMBINATORICS, GEOMETRY AND COMPUTER SCIENCE CONFERENCE
, 2007
"... The Densest kSubgraph (DkS) problem asks for a kvertex subgraph of a given graph with the maximum number of edges. The problem is strongly NPhard, as a generalization of the well known Clique problem and we also know that it does not admit a Polynomial Time Approximation Scheme (PTAS). In this p ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
The Densest kSubgraph (DkS) problem asks for a kvertex subgraph of a given graph with the maximum number of edges. The problem is strongly NPhard, as a generalization of the well known Clique problem and we also know that it does not admit a Polynomial Time Approximation Scheme (PTAS
PTAS for Densest kSubgraph in Interval Graphs
, 2011
"... Given an interval graph and integer k, we consider the problem of finding a subgraph of size k with a maximum number of induced edges, called densest ksubgraph problem in interval graphs. It has been shown that this problem is NPhard even for chordal graphs [17], and there is probably no PTAS for ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Given an interval graph and integer k, we consider the problem of finding a subgraph of size k with a maximum number of induced edges, called densest ksubgraph problem in interval graphs. It has been shown that this problem is NPhard even for chordal graphs [17], and there is probably no PTAS
Approximation schemes, cliques, colors and densest subgraphs
"... Abstract. In this thesis we study the problem of finding the densest ksubgraph of a given graph G = (V, E). We present algorithms of polynomial time as well as approximation results on special graph classes. Analytically, we study polynomial time algorithms for the densest ksubgraph problem on wei ..."
Abstract
 Add to MetaCart
Abstract. In this thesis we study the problem of finding the densest ksubgraph of a given graph G = (V, E). We present algorithms of polynomial time as well as approximation results on special graph classes. Analytically, we study polynomial time algorithms for the densest ksubgraph problem
Towards Realistic Team Formation in Social Networks based on Densest Subgraphs
"... Given a task T, a set of experts V with multiple skills and a social network G(V,W) reflecting the compatibility among the experts, team formation is the problem of identifying a team C ⊆ V that is both competent in performing the task T and compatible in working together. Existing methods for this ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
for this problem make too restrictive assumptions and thus cannot model practical scenarios. The goal of this paper is to consider the team formation problem in a realistic setting and present a novel formulation based on densest subgraphs. Our formulation allows modeling of many natural requirements such as (i
Multiskill Collaborative Teams based on Densest Subgraphs
, 2011
"... We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert in one or more skills such as theory, databases or data mining. The edge weights specify the affinity or collaborative ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
specific skill. We present a 3approximation algorithm that improves upon a naive extension of the previously known algorithm for densest at least k subgraph problem. We further show how the same approximation can be extended to a special case of multiple skills as well. Our problem generalizes
Denser than the Densest Subgraph: Extracting Optimal QuasiCliques with Quality Guarantees
"... Finding dense subgraphs is an important graphmining task with many applications. Given that the direct optimization of edge density is not meaningful, as even a single edge achieves maximum density, research has focused on optimizing alternative density functions. A very popular among such function ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
Finding dense subgraphs is an important graphmining task with many applications. Given that the direct optimization of edge density is not meaningful, as even a single edge achieves maximum density, research has focused on optimizing alternative density functions. A very popular among
A deterministic approximation algorithm for the Densest kSubgraph Problem
 International Journal of Operational Research
"... Abstract. In the Densest kSubgraph problem (DSP), we are given an undirected weighted graph G = (V, E) with n vertices (v1,..., vn). We seek to find a subset of k vertices (k belonging to {1,..., n}) which maximizes the number of edges which have their two endpoints in the subset. This problem is N ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract. In the Densest kSubgraph problem (DSP), we are given an undirected weighted graph G = (V, E) with n vertices (v1,..., vn). We seek to find a subset of k vertices (k belonging to {1,..., n}) which maximizes the number of edges which have their two endpoints in the subset. This problem
Results 1  10
of
882