1101 search results - page 63 / 221 » An Algorithm for the Graph Crossing Number Problem |
97
Voted
ACL
1998
15 years 3 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
114
click to vote
CCCG
2007
15 years 4 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
134
click to vote
QSHINE
2005
IEEE
15 years 8 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
125
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
125
Voted
WG
2010
Springer
15 years 27 days ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...