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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
31
click to vote
TALG
2008
favorite
Email
discuss
report
115
views
more
TALG 2008
»
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
13 years 10 months ago
Download
www.disp.uniroma2.it
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in
Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatki
Real-time Traffic
Minimal Dominating Sets
|
TALG 2008
|
claim paper
Related Content
»
Design by Measure and Conquer A Faster Exact Algorithm for Dominating Set
»
Reducing mechanism design to algorithm design via machine learning
»
An exact almost optimal algorithm for target set selection in social networks
»
DelayEnergy Tradeoffs in Wireless AdHoc Networks with Partial Channel State Information
more »
Post Info
More Details (n/a)
Added
15 Dec 2010
Updated
15 Dec 2010
Type
Journal
Year
2008
Where
TALG
Authors
Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
Comments
(0)
Researcher Info
TALG 2008 Study Group
Computer Vision