5473 search results - page 170 / 1095 » On the graph isomorphism problem |
195
click to vote
ALGORITHMICA
2002
15 years 7 months ago
2002
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...
222
Voted
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
162
click to vote
DAGSTUHL
2008
15 years 8 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
162
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
222
click to vote
COCOON
2007
Springer
16 years 1 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...