Sciweavers

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

9

DM
2002

favoriteEmaildiscussreport

49views more DM 2002»

The vertex-cover polynomial of a graph

13 years 10 months ago

The vertex-cover polynomial of a graph

Download math.nie.edu.sg

Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Char

Real-time Traffic

DM 2002 |

claim paper

Related Content

» Complexity and Approximation Results for the Connected Vertex Cover Problem

» Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph

» On Approximating Minimum Vertex Cover for Graphs with Perfect Matching

» Analysis of populationbased evolutionary algorithms for the vertex cover problem

» Maintaining a large matching and a small vertex cover

» Solving SAT using vertex covers

» MixedInteger Vertex Covers on Bipartite Graphs

» Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs

» Maintaining a Large Matching or a Small Vertex Cover

» Crown Structures for Vertex Cover Kernelization

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	DM
Authors	Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little

Comments (0)