760 search results - page 24 / 152 » Algorithms for finding clique-transversals of graphs |
143
click to vote
ICWS
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
119
click to vote
ICCD
2008
IEEE
16 years 2 months ago
2008
IEEE
—In this paper, a new FIR digital filter synthesis algorithm is proposed to consider multiple adder graphs for a coefficient. The proposed algorithm selects an adder graph that c...
161
click to vote
ENDM
2008
15 years 5 months ago
2008
A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of a...
145
click to vote
COCOON
2006
Springer
15 years 9 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
138
click to vote
IPL
2006
15 years 5 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing