1402 search results - page 22 / 281 » Searching Cycle-Disjoint Graphs |
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We consider the extension of the last-in-first-out graph searching game of Giannopoulou and Thilikos to digraphs. We show that all common variations of the game require the same ...
133
click to vote
UAI
2008
15 years 4 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
115
click to vote
SPIRE
2010
Springer
15 years 1 months ago
2010
Springer
This paper focuses on using hyperlinks in the ranking of web search results. We give a brief overview of the vast body of work in the area; we provide a quantitative comparison of ...
114
click to vote
EMNLP
2009
15 years 24 days ago
2009
We present an inexact search algorithm for the problem of predicting a two-layered dependency graph. The algorithm is based on a k-best version of the standard cubictime search al...
119
click to vote
CP
2006
Springer
15 years 6 months ago
2006
Springer
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...