1101 search results - page 39 / 221 » An Algorithm for the Graph Crossing Number Problem |
108
click to vote
IJCNLP
2005
Springer
15 years 7 months ago
2005
Springer
The current work applies Conditional Random Fields to the problem of temporal reference mapping from Chinese text to English text. The learning algorithm utilizes a moderate number...
132
click to vote
WG
2009
Springer
15 years 8 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
129
click to vote
DAM
2000
15 years 1 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
STOC
1993
ACM
15 years 6 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
265
click to vote
AAIM
2011
Springer
14 years 5 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...