1729 search results - page 85 / 346 » Bound Graph Polysemy |
139
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
145
click to vote
NIPS
1998
15 years 6 months ago
1998
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
132
click to vote
EJC
2008
15 years 5 months ago
2008
Abstract. We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new ...
132
Voted
DM
2007
15 years 5 months ago
2007
By Petersen’s theorem, a bridgeless cubic multigraph has a 2-factor. H. Fleischner generalised this result to bridgeless multigraphs of minimum degree at least three by showing ...
166
Voted
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...