Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

93

SOFSEM
2010
Springer

163views Theoretical Computer Science» more SOFSEM 2010»

Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph

15 years 11 months ago

Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph

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

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)