301 search results - page 14 / 61 » On Finding Dense Subgraphs |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
COCOON
2006
Springer
14 years 11 months ago
2006
Springer
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
106
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
80
Voted
RELMICS
2000
Springer
15 years 1 months ago
2000
Springer
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
ASAP
2008
IEEE
14 years 11 months ago
2008
IEEE
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and...