Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

It is well known that many local graph problems, like Vertex Cover and Dominating Set, can be solved in 2^{O(tw)}|V|^{O(1)} time… Expand

Is this relevant?

2008

2008

A t-spannerof a graph Gis a spanningsubgraph Sin which the distance between every pair ofvertices is at most ttimes their… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

We present a new algorithm that can output the rank-decomposition of width at most $k$ of a graph if such exists. For that we use… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric sub-modular functions, and give two… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix… Expand

Is this relevant?

2006

2006

We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

We introduce a new framework for designing fixed-parameter algorithms with subexponential running time---2O(&kradic;) nO(1). Our… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

Robertson and Seymour introduced branch-width as a new connectivity invariant of graphs in their proof of the Wagner conjecture… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

Graph minors theory, developed by Robertson & Seymour, provides a list of powerful theoretical results and tools. However, the… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

Suppose we expect there to bep(ab) phone calls between locationsa andb, all choices ofa, b from some setL of locations. We wish… Expand

Is this relevant?