6740 search results - page 387 / 1348 » An s -Hamiltonian Line Graph Problem |
146
click to vote
APVIS
2008
15 years 6 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...
139
click to vote
TIT
1998
15 years 4 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 ...
150
click to vote
CPM
2006
Springer
15 years 8 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...
142
click to vote
FCT
2009
Springer
15 years 11 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
130
click to vote
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
This paper presents a Conceptual Graph (cg) framework to the Generation of Referring Expressions (gre). Employing Conceptual Graphs as the underlying formalism allows a new rigorou...