384 search results - page 10 / 77 » On s-hamiltonian-connected line graphs |
JCT
2006
13 years 8 months ago
2006
Thomassen conjectured that every 4-connected line graph is hamiltonian. A vertex cut X of G is essential if G-X has at least two nontrivial components. We prove that every 3-conne...
PRIB
2010
Springer
13 years 7 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...
CONTEXT
2003
Springer
14 years 1 months ago
2003
Springer
This paper discusses the dynamic of context through the use of a context-based formalism called contextual graphs that has been initially developed in the SART application for the ...
GD
2005
Springer
14 years 2 months ago
2005
Springer
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
SPLC
2010
13 years 7 months ago
2010
Abstract. Software Product Line (SPL) engineering offers several advantages in the development of families of software products. There is still a need, however, for better underst...