6740 search results - page 354 / 1348 » An s -Hamiltonian Line Graph Problem |
142
click to vote
IPL
2010
15 years 1 months ago
2010
Polynomial algorithms are given for the following two problems:
153
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
120
click to vote
GBRPR
2007
Springer
15 years 10 months ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
127
click to vote
ISAAC
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a gi...
121
click to vote
LOPSTR
2004
Springer
15 years 9 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...