554 search results - page 87 / 111 » Power Domination Problem in Graphs |
DSN
2004
IEEE
13 years 11 months ago
2004
IEEE
A result checker is a program that checks the output of the computation of the observed program for correctness. Introduced originally by Blum, the result checking paradigm has pr...
FMSD
2008
13 years 7 months ago
2008
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
INFSOF
2007
13 years 7 months ago
2007
An infrastructure is a set of interconnected structural elements, such as tools and schemas, that provide a framework for supporting an entire structure. The reverse engineering c...
IJDSN
2008
13 years 7 months ago
2008
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
ECCC
2010
13 years 6 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...