1963 search results - page 67 / 393 » The Maximum Solution Problem on Graphs |
129
click to vote
JCP
2008
15 years 3 months ago
2008
Embedded systems have an ever-increasing need for optimizing compilers to produce high quality codes with a limited general purpose register set. Either memory or registers are use...
131
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
132
Voted
SIAMCOMP
2002
15 years 3 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
140
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...
144
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...