Sciweavers

2283 search results - page 65 / 457
» Bounds of Graph Characteristics
Sort
View
DM
2006
92views more  DM 2006»
13 years 8 months ago
Sums of powers of the degrees of a graph
For a graph G and k a real number, we consider the sum of the k-th powers of the degrees of the vertices of G. We present some general bounds on this sum for various values of k. ...
Sebastian M. Cioaba
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 8 months ago
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
ECAI
2010
Springer
13 years 8 months ago
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
Abstract. Algorithms for probabilistic inference in Bayesian networks are known to have running times that are worst-case exponential in the size of the network. For networks with ...
Johan Kwisthout, Hans L. Bodlaender, Linda C. van ...
AMW
2011
12 years 11 months ago
Bag Equivalence of Bounded Symmetry-Degree Conjunctive Queries with Inequalities
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
Mingmin Chen, Todd J. Green
ENDM
2010
101views more  ENDM 2010»
13 years 8 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl