Sciweavers

Share
2 search results - page 1 / 1
» PTAS for Densest k-Subgraph in Interval Graphs
Sort
View
ALGORITHMICA
2016
3 years 1 months ago
PTAS for Densest k-Subgraph in Interval Graphs
Given an interval graph and integer k, we consider the problem of ļ¬nding a subgraph of size k with a maximum number of induced edges, called densest k-subgraph problem in interv...
Tim Nonner
WAOA
2010
Springer
209views Algorithms» more  WAOA 2010»
8 years 3 months ago
Densest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
Danny Z. Chen, Rudolf Fleischer, Jian Li
books