Sciweavers

537 search results - page 5 / 108

» A new upper bound for 3-SAT

96

WEA
2005
Springer

88views Algorithms» more WEA 2005»

New Upper Bound Heuristics for Treewidth

15 years 11 months ago

New Upper Bound Heuristics for Treewidth

Download www.cs.uu.nl

Emgad H. Bachoore, Hans L. Bodlaender

claim paper

Read More »

101

CORR
2008
Springer

90views Education» more CORR 2008»

A New Upper Bound on the Capacity of a Class of Primitive Relay Channels

15 years 6 months ago

A New Upper Bound on the Capacity of a Class of Primitive Relay Channels

Download www.ece.umd.edu

Ravi Tandon, Sennur Ulukus

claim paper

Read More »

109

COMBINATORICS
2006

105views more COMBINATORICS 2006»

New Upper Bound for a Class of Vertex Folkman Numbers

15 years 6 months ago

New Upper Bound for a Class of Vertex Folkman Numbers

Download www.maths.tcd.ie

N. Kolev, N. Nenov

claim paper

Read More »

123

COMBINATORICS
2007

84views more COMBINATORICS 2007»

A New Upper Bound on the Total Domination Number of a Graph

15 years 6 months ago

A New Upper Bound on the Total Domination Number of a Graph

Download www.combinatorics.org

Michael A. Henning, Anders Yeo

claim paper

Read More »

147

JGT
2008

92views more JGT 2008»

A new upper bound for the bipartite Ramsey problem

15 years 6 months ago

A new upper bound for the bipartite Ramsey problem

Download www.dpmms.cam.ac.uk

We consider the following question: how large does n have to be to guarantee that in any two-colouring of the edges of the complete graph Kn,n there is a monochromatic Kk,k? In th...

David Conlon

claim paper

Read More »

« Prev « First page 5 / 108 Last » Next »