15254 search results - page 307 / 3051 » A k |
219
Voted
ISAAC
2009
Springer
16 years 2 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
170
Voted
CSCLP
2005
Springer
16 years 1 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
180
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we analyze the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on ...