966 search results - page 74 / 194 » Small Alliances in Graphs |
DSN
2000
IEEE
14 years 1 months ago
2000
IEEE
In this paper, we propose new scheduling algorithms to achieve fault security in multiprocessor systems. We consider scheduling of parallel programs represented by directed acycli...
ALGORITHMICA
2010
13 years 9 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
DAM
2010
13 years 8 months ago
2010
A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number...
PVLDB
2010
13 years 7 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...