175 search results - page 2 / 35 » max-cut and Containment Relations in Graphs |
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
LREC
2010
13 years 7 months ago
2010
We introduce a method for automatically labelling edges of word co-occurrence graphs with semantic relations. Therefore we only make use of training data already contained within ...
WG
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
SSDBM
2005
IEEE
13 years 11 months ago
2005
IEEE
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
ICML
2007
IEEE
14 years 6 months ago
2007
IEEE
We present a method for parameter learning in relational Bayesian networks (RBNs). Our approach consists of compiling the RBN model into a computation graph for the likelihood fun...