Sciweavers

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

58

Voted

CORR
1998
Springer

favoriteEmaildiscussreport

75views Education» more CORR 1998»

The Complexity of Planar Counting Problems

14 years 11 months ago

The Complexity of Planar Counting Problems

Download perso.ens-lyon.fr

Harry B. Hunt III, Madhav V. Marathe, Venkatesh Ra

Real-time Traffic

CORR 1998 | Education |

claim paper

Related Content

» Parity Problems in Planar Graphs

» Refined Bounds for InstanceBased Search Complexity of Counting and Other P Problems

» The Parameterized Complexity of Counting Problems

» On the relative complexity of approximate counting problems

» The Complexity of Counting Problems in Equational Matching

» The Parameterized Complexity of the Induced Matching Problem in Planar Graphs

» Parameterized Complexity Exponential SpeedUp for Planar Graph Problems

» Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities

» The Complexity of Planarity Testing

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	CORR
Authors	Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns

Comments (0)