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
»
Decomposition, Approximation, and Coloring of Odd-Minor-Free...
Sort
relevance
views
votes
recent
update
View
thumb
title
15
click to vote
SODA
2010
ACM
216
views
Algorithms
»
more
SODA 2010
»
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
14 years 2 months ago
Download
erikdemaine.org
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
claim paper
Read More »
29
click to vote
FOCS
2005
IEEE
219
views
Theoretical Computer Science
»
more
FOCS 2005
»
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
13 years 11 months ago
Download
www-math.mit.edu
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ic...
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »