760 search results - page 38 / 152 » Algorithms for finding clique-transversals of graphs |
IJDSN
2008
13 years 8 months ago
2008
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
TIT
2008
13 years 8 months ago
2008
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
IROS
2009
IEEE
14 years 3 months ago
2009
IEEE
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
DATE
1999
IEEE
14 years 1 months ago
1999
IEEE
We present a novel algorithm based on dynamic programming with binning to find, subject to a given deadline, the minimum-cost coarse-grain hardware/software partitioning and mappin...