Sciweavers

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

5

DAM
2007

favoriteEmaildiscussreport

47views more DAM 2007»

Tutte sets in graphs II: The complexity of finding maximum Tutte sets

13 years 4 months ago

Tutte sets in graphs II: The complexity of finding maximum Tutte sets

Download www.dur.ac.uk

Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora

Real-time Traffic

DAM 2007 |

claim paper

Related Content

» On the Theory of Pfaffian Orientations II Tjoins kcuts and Duality of Enumeration

» Nodally 3connected planar graphs and convex combination mappings

» A New Algorithm for Finding Minimal CycleBreaking Sets of Turns in a Graph

» Minimax Embeddings

» On LowComplexity MaximumLikelihood Decoding of Convolutional Codes

» The Matching Predicate and a Filtering Scheme Based on Matroids

» On Finding Frequent Patterns in Event Sequences

» The Wiener maximum quadratic assignment problem

» Approximation and Complexity of kSplittable Flows

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	DAM
Authors	Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, T. Surowiec

Comments (0)