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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
89
Voted
CONCURRENCY
2000
72
views
more
CONCURRENCY 2000
»
Scalable parallel graph coloring algorithms
15 years 2 months ago
Download
www.ii.uib.no
Assefaw Hadish Gebremedhin, Fredrik Manne
Real-time Traffic
CONCURRENCY 2000
|
claim paper
Related Content
»
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
»
A framework for scalable greedy coloring on distributedmemory parallel computers
»
A Parallel Distance2 Graph Coloring Algorithm for Distributed Memory Computers
»
On Sum Coloring of Graphs with Parallel Genetic Algorithms
»
Speeding up Parallel Graph Coloring
»
Parallel Simulated Annealing Algorithm for Graph Coloring Problem
»
Efficient Algorithms for Weighted Colorings of SeriesParallel Graphs
»
A Scalable Distributed Parallel BreadthFirst Search Algorithm on BlueGeneL
»
Brief announcement efficient graph algorithms without synchronization
more »
Post Info
More Details (n/a)
Added
17 Dec 2010
Updated
17 Dec 2010
Type
Journal
Year
2000
Where
CONCURRENCY
Authors
Assefaw Hadish Gebremedhin, Fredrik Manne
Comments
(0)
Researcher Info
CONCURRENCY 2010 Study Group
Computer Vision