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
16
search results - page 4 / 4
»
An Iterated Dynasearch Algorithm for the Single-Machine Tota...
Sort
relevance
views
votes
recent
update
View
thumb
title
37
click to vote
ICALP
2011
Springer
252
views
Programming Languages
»
more
ICALP 2011
»
Vertex Cover in Graphs with Locally Few Colors
12 years 11 months ago
Download
www.inf.usi.ch
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
claim paper
Read More »
« Prev
« First
page 4 / 4
Last »
Next »