Sciweavers

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

5

CORR
2006
Springer

favoriteEmaildiscussreport

116views Education» more CORR 2006»

On Covering a Graph Optimally with Induced Subgraphs

13 years 4 months ago

On Covering a Graph Optimally with Induced Subgraphs

Download www.win.tue.nl

Shripad Thite

Real-time Traffic

CORR 2006 | Education |

claim paper

Related Content

» The Maximum Common Subgraph Problem Faster Solutions via Vertex Cover

» Covering minimum spanning trees of random subgraphs

» Excluding induced subgraphs Critical graphs

» The chromatic covering number of a graph

» Cycle Covering

» Connected Vertex Covers in Dense Graphs

» Vertex and Edge Covers with Clustering Properties Complexity and Algorithms

» Minimal Universal Bipartite Graphs

» Crown Structures for Vertex Cover Kernelization

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Shripad Thite

Comments (0)