6740 search results - page 231 / 1348 » An s -Hamiltonian Line Graph Problem |
106
click to vote
BMCBI
2008
15 years 23 days ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
101
Voted
DAM
2006
15 years 21 days 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 ...
107
Voted
ALGORITHMICA
2002
15 years 16 days ago
2002
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...
128
click to vote
WDAG
2009
Springer
15 years 7 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,...
86
Voted
DAGSTUHL
2008
15 years 2 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 ...