1963 search results - page 12 / 393 » The Maximum Solution Problem on Graphs |
DNA
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
TCS
2010
13 years 7 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
COLING
1994
13 years 10 months ago
1994
The revised graph unification algorithms presented here are more efficient because they reduce the amount of copying that was necessary because of the assumption that data-structu...
JCT
2010
13 years 7 months ago
2010
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...