1629 search results - page 70 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
EDBT
2006
ACM
15 years 10 months ago
2006
ACM
Abstract. We identify and explore in this paper an important phenomenon which points out that the power-law relationship appears in the distribution of itemset supports. Characteri...
181
click to vote
AAIM
2011
Springer
14 years 1 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
MST
2010
14 years 8 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
SAT
2004
Springer
15 years 3 months ago
2004
Springer
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...