Sciweavers

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

15

CATS
2008

favoriteEmaildiscussreport

172views Applied Computing» more CATS 2008»

The Parameterized Complexity of Regular Subgraph Problems and Generalizations

13 years 5 months ago

The Parameterized Complexity of Regular Subgraph Problems and Generalizations

Download www.dur.ac.uk

Luke Mathieson, Stefan Szeider

Real-time Traffic

Applied Computing | CATS 2008 |

claim paper

Related Content

» Parameterized Complexity of Finding Regular Induced Subgraphs

» Parameterized complexity of the induced subgraph problem in directed graphs

» Parameterized Complexity of the ArcPreserving Subsequence Problem

» Parameterized Complexity of EvenOdd Subgraph Problems

» The complexity of uniform Nash equilibria and related regular subgraph problems

» Parameterized Complexity of Finding Subgraphs with Hereditary Properties

» On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems

» Connected Coloring Completion for General Graphs Algorithms and Complexity

» The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	CATS
Authors	Luke Mathieson, Stefan Szeider

Comments (0)