Sciweavers

1425 search results - page 45 / 285
» Beyond Dependency Graphs
Sort
View
DAM
2010
92views more  DAM 2010»
13 years 8 months ago
Enumeration of matchings in families of self-similar graphs
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
Elmar Teufl, Stephan Wagner
CPC
2010
116views more  CPC 2010»
13 years 5 months ago
A Separator Theorem for String Graphs and its Applications
A string graph is the intersection graph of a collection of continuous arcs in the plane. It is shown that any string graph with m edges can be separated into two parts of roughly...
Jacob Fox, János Pach
IPL
2008
82views more  IPL 2008»
13 years 8 months ago
On fully orientability of 2-degenerate graphs
Suppose that D is an acyclic orientation of the graph G. An arc of D is dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Defi...
Hsin-Hao Lai, Gerard J. Chang, Ko-Wei Lih
AGTIVE
2007
Springer
14 years 2 months ago
Using Graph Transformation to Support Collaborative Ontology Evolution
In collaborative ontology engineering, contexts are key to manage the complexity of different dependency types between ontological artefacts. Instead of being frustrated by out-of...
Pieter De Leenheer, Tom Mens
ACL
2009
13 years 5 months ago
Sentence diagram generation using dependency parsing
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
Elijah Mayfield