760 search results - page 81 / 152 » Algorithms for finding clique-transversals of graphs |
187
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Along with the blossom of open source projects comes the convenience for software plagiarism. A company, if less self-disciplined, may be tempted to plagiarize some open source pr...
165
Voted
CATS
2006
15 years 6 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
155
Voted
DAM
2010
15 years 5 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
143
Voted
ICIP
2003
IEEE
16 years 7 months ago
2003
IEEE
This paper proposes a model-based methodology for recognizing and tracking objects in digital image sequences. Objects are represented by attributed relational graphs (or ARGs), w...
159
click to vote
EVOW
2004
Springer
15 years 10 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...