Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
Cleaning Random d-Regular Graphs with Brooms
Sort
relevance
views
votes
recent
update
View
thumb
title
26
click to vote
GC
2011
Springer
240
views
Applied Computing
»
more
GC 2011
»
Cleaning Random d-Regular Graphs with Brooms
12 years 12 months ago
Download
www.math.ryerson.ca
Pawel Pralat
claim paper
Read More »
30
click to vote
CAAN
2007
Springer
143
views
Discrete Geometry
»
more
CAAN 2007
»
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
14 years 2 months ago
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 »
« Prev
« First
page 1 / 1
Last »
Next »