1629 search results - page 2 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
101
click to vote
FUIN
2000
15 years 27 days ago
2000
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
115
Voted
TAMC
2009
Springer
15 years 7 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
107
Voted
VLSID
2002
IEEE
16 years 1 months ago
2002
IEEE
In this paper, we present a functional partitioning method for low power real-time distributed embedded systems whose constituent nodes are systems-on-a-chip (SOCs). The systemlev...
109
Voted
JCSS
2011
14 years 8 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
71
Voted
FCT
2005
Springer
15 years 6 months ago
2005
Springer