1963 search results - page 144 / 393 » The Maximum Solution Problem on Graphs |
DAC
2009
ACM
14 years 4 months ago
2009
ACM
For a computing system to be trusted, it is equally important to verify that the system performs no more and no less functionalities than desired. Traditional testing and verifica...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MOBIHOC
2008
ACM
14 years 9 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
ESA
2006
Springer
14 years 1 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
EUROGP
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...