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
22
click to vote
SOFSEM
2010
Springer
favorite
Email
discuss
report
163
views
Theoretical Computer Science
»
more
SOFSEM 2010
»
Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph
14 years 6 months ago
Download
www.sofsem.cz
Alexander Grigoriev, Bert Marchal, Natalya Usotska
Real-time Traffic
SOFSEM 2010
|
Theoretical Computer Science
|
claim paper
Related Content
»
Vertex and Edge Covers with Clustering Properties Complexity and Algorithms
»
Approximation algorithms for partially covering with edges
»
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
»
The Minimum Generalized Vertex Cover Problem
»
Covering minimum spanning trees of random subgraphs
»
The importance of being biased
»
Approximations for minimum and minmax vehicle routing problems
»
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
»
Approximating the minimum clique cover and other hard problems in subtree filament graphs
more »
Post Info
More Details (n/a)
Added
17 Mar 2010
Updated
17 Mar 2010
Type
Conference
Year
2010
Where
SOFSEM
Authors
Alexander Grigoriev, Bert Marchal, Natalya Usotskaya
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision