Sciweavers

1664 search results - page 143 / 333
» Distance labeling in graphs
Sort
View
ACL
2011
14 years 10 months ago
Semi-Supervised Frame-Semantic Parsing for Unknown Predicates
We describe a new approach to disambiguating semantic frames evoked by lexical predicates previously unseen in a lexicon or annotated data. Our approach makes use of large amounts...
Dipanjan Das, Noah A. Smith
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 6 months ago
The Plane-Width of Graphs
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
Marcin Kaminski, Paul Medvedev, Martin Milanic
DM
2010
90views more  DM 2010»
15 years 6 months ago
The firefighter problem for cubic graphs
We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is the same distance from t...
Andrew King, Gary MacGillivray
FOSSACS
2009
Springer
16 years 1 months ago
Separating Graph Logic from MSO
Abstract. Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of ...
Timos Antonopoulos, Anuj Dawar
GG
2004
Springer
15 years 12 months ago
Representing First-Order Logic Using Graphs
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
Arend Rensink