6740 search results - page 42 / 1348 » An s -Hamiltonian Line Graph Problem |
FC
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
EJC
2008
13 years 7 months ago
2008
A partial linear space is a non-empty set of points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every lin...
PRIB
2010
Springer
13 years 6 months ago
2010
Springer
We present a structured output prediction approach for classifying potential anti-cancer drugs. Our QSAR model takes as input a description of a molecule and predicts the activity...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
ORL
2007
13 years 7 months ago
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...