Sciweavers

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

21

ICALP
2007
Springer

favoriteEmaildiscussreport

98views Programming Languages» more ICALP 2007»

Complexity of the Cover Polynomial

14 years 5 months ago

Complexity of the Cover Polynomial

Download www-cc.cs.uni-saarland.de

Markus Bläser, Holger Dell

Real-time Traffic

ICALP 2007 | Theoretical Computer Science |

claim paper

Related Content

» From a Zoo to a Zoology Descriptive Complexity for Graph Polynomials

» From a Zoo to a Zoology Towards a General Theory of Graph Polynomials

» Complexity and Approximation Results for the Connected Vertex Cover Problem

» The complexity of cover inequality separation

» The Complexity of Computing Minimal Unidirectional Covering Sets

» The Complexity of the Covering Radius Problem on Lattices and Codes

» A polynomial solution to the kfixedendpoint path cover problem on proper interval graphs

» The Hilbert Series of the Face Ring of a Flag Complex

» Learning Factor Graphs in Polynomial Time and Sample Complexity

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	ICALP
Authors	Markus Bläser, Holger Dell

Comments (0)