Sciweavers

109 search results - page 6 / 22
» Hamiltonian Connected Line Graphs
Sort
View
ENTCS
2008
98views more  ENTCS 2008»
13 years 7 months ago
Modal Expressiveness of Graph Properties
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
Mario R. F. Benevides, L. Menasché Schechte...
CORR
2007
Springer
76views Education» more  CORR 2007»
13 years 7 months ago
A Light-Based Device for Solving the Hamiltonian Path Problem
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on ...
Mihai Oltean
CORR
2007
Springer
93views Education» more  CORR 2007»
13 years 7 months ago
Solving the Hamiltonian path problem with a light-based computer
Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational device which uses light rays for solving the Hami...
Mihai Oltean
ISAAC
2009
Springer
103views Algorithms» more  ISAAC 2009»
14 years 1 months ago
Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs
It is shown that if a planar straight line graph (PSLG) with n vertices in general position in the plane can be augmented to a 3-edge-connected PSLG, then 2n−2 new edges are enou...
Marwan Al-Jubeh, Mashhood Ishaque, Kristóf ...
ACCV
2010
Springer
13 years 2 months ago
Network Connectivity via Inference over Curvature-Regularizing Line Graphs
Abstract. Diffusion Tensor Imaging (DTI) provides estimates of local directional information regarding paths of white matter tracts in the human brain. An important problem in DTI ...
Maxwell D. Collins, Vikas Singh, Andrew L. Alexand...