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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
12
search results - page 1 / 3
»
gc 2011
Sort
relevance
views
votes
recent
update
View
thumb
title
136
click to vote
GC
2011
Springer
240
views
Applied Computing
»
more
GC 2011
»
Cleaning Random d-Regular Graphs with Brooms
14 years 6 months ago
Download
www.math.ryerson.ca
Pawel Pralat
claim paper
Read More »
125
click to vote
GC
2011
Springer
261
views
Applied Computing
»
more
GC 2011
»
The Cycle Discrepancy of Three-Regular Graphs
14 years 10 months ago
Download
dimacs.rutgers.edu
Sarmad Abbasi, Laeeq Aslam
claim paper
Read More »
153
click to vote
GC
2011
Springer
210
views
Applied Computing
»
more
GC 2011
»
The Number of Independent Sets in a Graph with Small Maximum Degree
14 years 10 months ago
Download
www.nd.edu
David Galvin, Yufei Zhao
claim paper
Read More »
128
click to vote
GC
2011
Springer
192
views
Applied Computing
»
more
GC 2011
»
Algorithmic Folding Complexity
14 years 6 months ago
Download
www.jaist.ac.jp
Jean Cardinal, Erik D. Demaine, Martin L. Demaine,...
claim paper
Read More »
144
click to vote
GC
2011
Springer
212
views
Applied Computing
»
more
GC 2011
»
Minimum Clique Partition in Unit Disk Graphs
14 years 6 months ago
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 »