225 search results - page 14 / 45 » From polynomial time queries to graph structure theory |
DAM
2008
14 years 9 months ago
2008
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
75
Voted
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
TALG
2010
14 years 8 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
108
click to vote
AI
2010
Springer
14 years 9 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
UAI
2000
14 years 11 months ago
2000
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...