301 search results - page 29 / 61 » On Finding Dense Subgraphs |
76
Voted
VLSID
2008
IEEE
15 years 10 months ago
2008
IEEE
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
IPCO
2010
14 years 11 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
IADIS
2004
14 years 11 months ago
2004
The study on the topological structure of the Internet is very important for the simulation and the protocol design of the Internet. In recent years, some researchers have made pr...
SIAMSC
2008
14 years 9 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
70
Voted
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expr...