6740 search results - page 345 / 1348 » An s -Hamiltonian Line Graph Problem |
138
click to vote
DAM
2008
15 years 4 months ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
140
click to vote
DAM
2006
15 years 4 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
172
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
195
click to vote
CPM
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
167
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Graph matching is an important problem in computer
vision. It is used in 2D and 3D object matching and recognition.
Despite its importance, there is little literature on
learnin...