301 search results - page 26 / 61 » On Finding Dense Subgraphs |
93
Voted
CASES
2004
ACM
15 years 1 months ago
2004
ACM
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
67
Voted
ESA
2010
Springer
14 years 10 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
DAM
2008
14 years 9 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
76
Voted
DAM
2008
14 years 9 months ago
2008
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
101
Voted
SDM
2003
SIAM
14 years 11 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...