Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection
Journal of Global Optimization
Complexity of finding dense subgraphs
Discrete Applied Mathematics
Maximum dispersion and geometric maximum weight cliques
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Greedy approximation algorithms for finding dense components in a graph
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
DS '99 Proceedings of the Second International Conference on Discovery Science
Journal of Global Optimization
Utility based sensor selection
Proceedings of the 5th international conference on Information processing in sensor networks
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
The complexity of detecting fixed-density clusters
Discrete Applied Mathematics
The inverse protein folding problem on 2D and 3D lattices
Discrete Applied Mathematics
Dynamical Systems for Discovering Protein Complexes and Functional Modules from Biological Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Finding dense and isolated submarkets in a sponsored search spending graph
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
A local algorithm for finding dense subgraphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A constant approximation algorithm for the densest k-subgraph problem on chordal graphs
Information Processing Letters
Finding a dense-core in Jellyfish graphs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Solving Generalized Maximum Dispersion with Linear Programming
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Finding Dense Subgraphs with Size Bounds
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
The complexity of detecting fixed-density clusters
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Finding a dense-core in Jellyfish graphs
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing
A local algorithm for finding dense subgraphs
ACM Transactions on Algorithms (TALG)
Densest k-subgraph approximation on intersection graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Improved approximation algorithms for maximum graph partitioning problems extended abstract
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Finding dense subgraphs of sparse graphs
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
The maximum vertex coverage problem on bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
Given an n-vertex graph G and a parameter k, we are to find a k-vertex subgraph with the maximum number of edges. This problem is NP-hard. We show that the problem remains NP-hard even when the maximum degree in G is three. When G contains a k-clique, we give an algorithm that for any e sub/sub