Sciweavers

823 search results - page 109 / 165
» Brick partitions of graphs
Sort
View
CPC
2007
61views more  CPC 2007»
15 years 1 months ago
Maximizing Several Cuts Simultaneously
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...
Daniela Kühn, Deryk Osthus
JSAT
2006
73views more  JSAT 2006»
15 years 1 months ago
Impurity: Another Phase Transition of SAT
It is well known that satisfiability of random sets of propositional clauses undergoes phase transition while the clause-to-variable ratio of the sets increases. We introduce anot...
Eliezer L. Lozinskii
JCT
2007
107views more  JCT 2007»
15 years 1 months ago
On a conjecture of Wilf
Abstract. Let n and k be natural numbers and let S(n, k) denote the Stirling numbers of the second kind. It is a conjecture of Wilf that the alternating sum nX j=0 (−1)j S(n, j) ...
Stefan De Wannemacker, Thomas Laffey, Robert Osbur...
RSA
2010
118views more  RSA 2010»
15 years 11 days ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
AAAI
2008
15 years 4 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang