Sciweavers

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

88

Voted

WG
2001
Springer

82views Theoretical Computer Science» more WG 2001»

The Complexity of the Matching-Cut Problem

15 years 7 months ago

The Complexity of the Matching-Cut Problem

Download web.dia.uniroma3.it

Maurizio Patrignani, Maurizio Pizzonia

Real-time Traffic

Theoretical Computer Science | WG 2001 |

claim paper

Related Content

» The standing ovation problem

» The Equivalence between Ordinal Optimization in Deterministic Complex Problems and in Stoc...

» Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem

» Problem complexity

» Genericcase complexity decision problems in group theory and random walks

» Complexity of the traveling tournament problem

» Towards AverageCase Complexity Analysis of NP Optimization Problems

» Some Decision Problems of Enormous Complexity

» The Complexity of the List Homomorphism Problem for Graphs

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	WG
Authors	Maurizio Patrignani, Maurizio Pizzonia

Comments (0)