Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
24
Voted
WG
2001
Springer
favorite
Email
discuss
report
82
views
Theoretical Computer Science
»
more
WG 2001
»
The Complexity of the Matching-Cut Problem
14 years 3 months ago
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
more »
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)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision