5889 search results - page 336 / 1178 » Graph Layout Problems |
179
click to vote
WG
2009
Springer
16 years 1 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
158
click to vote
ICRA
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— In this paper, we formalize the problem of barrier coverage, that is, the problem of preventing undetected intrusion in a particular region using robot sensors. We solv...
186
click to vote
APVIS
2008
15 years 8 months ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
177
click to vote
TIT
1998
15 years 6 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
184
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...