138 search results - page 6 / 28 » Algorithms for induced biclique optimization problems |
101
click to vote
AICCSA
2007
IEEE
15 years 6 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
117
click to vote
EVOW
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The advancement of network induces great demands on a series of applications such as the multicast routing. This paper firstly makes a brief review on the algorithms in ...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
119
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
TMC
2010
14 years 10 months ago
2010
—Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. Storage nodes are introdu...