Sciweavers

401 search results - page 23 / 81

» Sparse Quasi-Random Graphs

60

CPC
2004

65views more CPC 2004»

On the b-Independence Number of Sparse Random Graphs

14 years 11 months ago

On the b-Independence Number of Sparse Random Graphs

Download www.math.cmu.edu

Geoffrey Atkinson, Alan M. Frieze

claim paper

Read More »

85

CC
2000
Springer

90views System Software» more CC 2000»

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

14 years 11 months ago

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

Download web.maths.unsw.edu.au

Catherine S. Greenhill

claim paper

Read More »

96

Voted

COMBINATORICS
2002

67views more COMBINATORICS 2002»

Sparse Graphs Usually Have Exponentially Many Optimal Colorings

14 years 11 months ago

Sparse Graphs Usually Have Exponentially Many Optimal Colorings

Download www.combinatorics.org

Michael Krivelevich

claim paper

Read More »

103

CORR
2007
Springer

135views Education» more CORR 2007»

Detailed Network Measurements Using Sparse Graph Counters: The Theory

14 years 11 months ago

Detailed Network Measurements Using Sparse Graph Counters: The Theory

Download www.stanford.edu

— Measuring network ﬂow sizes is important for tasks like accounting/billing, network forensics and security. Per-ﬂow accounting is considered hard because it requires that m...

Yi Lu, Andrea Montanari, Balaji Prabhakar

claim paper

Read More »

58

COMBINATORICS
1999

64views more COMBINATORICS 1999»

Intersections of Randomly Embedded Sparse Graphs are Poisson

14 years 11 months ago

Intersections of Randomly Embedded Sparse Graphs are Poisson

Download www.combinatorics.org

Edward A. Bender, E. Rodney Canfield

claim paper

Read More »

« Prev « First page 23 / 81 Last » Next »