Sciweavers

1605 search results - page 212 / 321
» On Partitional Labelings of Graphs
Sort
View
4OR
2007
103views more  4OR 2007»
15 years 3 months ago
Compact linearization for binary quadratic problems
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
Leo Liberti
EJC
2008
15 years 3 months ago
Grad and classes with bounded expansion I. Decompositions
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 ...
Jaroslav Nesetril, Patrice Ossona de Mendez
122
Voted
CPC
2007
61views more  CPC 2007»
15 years 2 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 2 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 2 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...