Sciweavers

Share ➚
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CAAN
2007
Springer
143views Discrete Geometry» more  CAAN 2007»
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
12 years 9 months ago
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
Download  www.mathstat.dal.ca
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
Margaret-Ellen Messinger, Pawel Pralat, Richard J....
claim paper
Read More »
Explore & Download
Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
Productivity Tools
International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
Document Tools
PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
Image Tools
JPG to PS JPG to PDF Extract Images from PDF Image Converter
Sciweavers
About Community Report Bug Request Feature Cookies Privacy Policy Terms of Use Contact

Copyright © 2009-2011 Sciweavers LLC. All rights reserved.

books