A fast parametric maximum flow algorithm and applications
SIAM Journal on Computing
Inferring Web communities from link topology
Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems
Clustering in large graphs and matrices
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Authoritative sources in a hyperlinked environment
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Greedily finding a dense subgraph
Journal of Algorithms
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Fast Monte-Carlo Algorithms for finding low-rank approximations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
On the densest k-subgraph problems
On the densest k-subgraph problems
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A Graph-Based Approach for Image Segmentation
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Finding Dense Subgraphs with Size Bounds
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A Graph Based Approach to Speaker Retrieval in Talk Show Videos with Transcript-Based Supervision
PCM '09 Proceedings of the 10th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
A local algorithm for finding dense subgraphs
ACM Transactions on Algorithms (TALG)
The community-search problem and how to plan a successful cocktail party
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Algorithms and theory of computation handbook
Detecting sybil nodes in static and dynamic networks
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II
Link prediction for annotation graphs using graph summarization
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
An OpenMP algorithm and implementation for clustering biological graphs
Proceedings of the first workshop on Irregular applications: architectures and algorithm
Face Recognition from Caption-Based Supervision
International Journal of Computer Vision
Densest subgraph in streaming and MapReduce
Proceedings of the VLDB Endowment
Facing scalability: Naming faces in an online social network
Pattern Recognition
Dense subgraphs with restrictions and applications to gene annotation graphs
RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
Finding people frequently appearing in news
CIVR'06 Proceedings of the 5th international conference on Image and Video Retrieval
Approximation scheme for lowest outdegree orientation and graph density measures
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Framework and algorithms for network bucket testing
Proceedings of the 21st international conference on World Wide Web
Learning from graph data by putting graphs on the lattice
Expert Systems with Applications: An International Journal
Where do I start?: algorithmic strategies to guide intelligence analysts
Proceedings of the ACM SIGKDD Workshop on Intelligence and Security Informatics
Dense and sparse graph partition
Discrete Applied Mathematics
On quadratic programming with a ratio objective
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Finding cross genome patterns in annotation graphs
DILS'12 Proceedings of the 8th international conference on Data Integration in the Life Sciences
Proceedings of the 21st ACM international conference on Information and knowledge management
Dense subgraphs on dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Arrival and departure dynamics in social networks
Proceedings of the sixth ACM international conference on Web search and data mining
Fast greedy algorithms in mapreduce and streaming
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Piggybacking on social networks
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
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.