5889 search results - page 193 / 1178 » Graph Layout Problems |
155
click to vote
DAM
2006
15 years 6 months ago
2006
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a ...
179
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...
205
click to vote
WDAG
2009
Springer
16 years 29 days 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,...
147
click to vote
DAGSTUHL
2008
15 years 7 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 ...
143
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...