Sciweavers

3396 search results - page 57 / 680
» Tree representations of graphs
Sort
View
118
Voted
ALGORITHMICA
2010
147views more  ALGORITHMICA 2010»
15 years 21 days ago
Note on the Structure of Kruskal's Algorithm
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
Nicolas Broutin, Luc Devroye, Erin McLeish
139
Voted
EMNLP
2009
14 years 10 months ago
Natural Language Generation with Tree Conditional Random Fields
This paper presents an effective method for generating natural language sentences from their underlying meaning representations. The method is built on top of a hybrid tree repres...
Wei Lu, Hwee Tou Ng, Wee Sun Lee
98
Voted
WG
2004
Springer
15 years 6 months ago
Treelike Comparability Graphs: Characterization, Recognition, and Applications
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
Sabine Cornelsen, Gabriele Di Stefano
93
Voted
SSS
2009
Springer
107views Control Systems» more  SSS 2009»
15 years 7 months ago
A Self-stabilizing Algorithm for Graph Searching in Trees
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
Rodica Mihai, Morten Mjelde
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
15 years 12 days ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...