384 search results - page 50 / 77 » On s-hamiltonian-connected line graphs |
ENDM
2008
13 years 8 months 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...
OWLED
2008
13 years 10 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...
ESOP
2010
Springer
14 years 6 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
14 years 2 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
14 years 2 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 ...