Sciweavers

12 search results - page 1 / 3

» gc 2011

22

GC
2011
Springer

240views Applied Computing» more GC 2011»

Cleaning Random d-Regular Graphs with Brooms

12 years 11 months ago

Cleaning Random d-Regular Graphs with Brooms

Download www.math.ryerson.ca

Pawel Pralat

claim paper

Read More »

22

GC
2011
Springer

261views Applied Computing» more GC 2011»

The Cycle Discrepancy of Three-Regular Graphs

13 years 2 months ago

The Cycle Discrepancy of Three-Regular Graphs

Download dimacs.rutgers.edu

Sarmad Abbasi, Laeeq Aslam

claim paper

Read More »

26

GC
2011
Springer

210views Applied Computing» more GC 2011»

The Number of Independent Sets in a Graph with Small Maximum Degree

13 years 2 months ago

The Number of Independent Sets in a Graph with Small Maximum Degree

Download www.nd.edu

David Galvin, Yufei Zhao

claim paper

Read More »

26

GC
2011
Springer

192views Applied Computing» more GC 2011»

Algorithmic Folding Complexity

12 years 11 months ago

Algorithmic Folding Complexity

Download www.jaist.ac.jp

Jean Cardinal, Erik D. Demaine, Martin L. Demaine,...

claim paper

Read More »

20

GC
2011
Springer

212views Applied Computing» more GC 2011»

Minimum Clique Partition in Unit Disk Graphs

12 years 11 months ago

Minimum Clique Partition in Unit Disk Graphs

Download www.cs.uwm.edu

The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...

Adrian Dumitrescu, János Pach

claim paper

Read More »

« Prev « First page 1 / 3 Last » Next »