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
31
search results - page 7 / 7
»
eccc 2008
Sort
relevance
views
votes
recent
update
View
thumb
title
36
click to vote
SODA
2012
ACM
218
views
Algorithms
»
more
SODA 2012
»
Linear kernels for (connected) dominating set on H-minor-free graphs
11 years 11 months ago
Download
www.ii.uib.no
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
claim paper
Read More »
« Prev
« First
page 7 / 7
Last »
Next »