384 search results - page 50 / 77 » On s-hamiltonian-connected line graphs |
103
Voted
ENDM
2008
15 years 15 days ago
2008
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
117
click to vote
OWLED
2008
15 years 1 months ago
2008
Product development requires the ability to check design consistency, to verify design properties, and to answer questions about a design's possible implementations. These tas...
102
Voted
ESOP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We present a framework that automatically produces suggestions to resolve type errors in security-typed programs, enabling legacy code to be retrofit with comprehensive s...
ICDAR
2005
IEEE
15 years 6 months ago
2005
IEEE
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...