2283 search results - page 62 / 457 » Bounds of Graph Characteristics |
125
click to vote
JCT
2007
15 years 3 months ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
142
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
122
click to vote
NIPS
2008
15 years 4 months ago
2008
We propose a novel bound on single-variable marginal probability distributions in factor graphs with discrete variables. The bound is obtained by propagating local bounds (convex ...
137
Voted
UAI
2004
15 years 4 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
109
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence betwe...