Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

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

Highly Cited

2014

Highly Cited

2014

We present a heuristic algorithm for finding a graph $H$ as a minor of a graph $G$ that is practical for sparse $G$ and $H$ with… Expand

Is this relevant?

Highly Cited

2014

Highly Cited

2014

One of the key results in Robertson and Seymour's seminal work on graph minors is the Grid-Minor Theorem (also called the… Expand

Is this relevant?

Highly Cited

2011

Highly Cited

2011

In Choi (Quantum Inf Process, 7:193–209, 2008), we introduced the notion of minor-embedding in adiabatic quantum optimization. A… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

Testing a property P of graphs in the bounded degree model deals with the following problem: given a graph G of bounded degree d… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

The rank-width is a graph parameter related in terms of fixed functions to clique-width but more tractable. Clique-width has nice… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

Regulation by the state can take a variety of forms. Some regulations are aimed entirely at redistribution, such as when we tax… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

Recent results on graph minors make it desirable to have efficient algorithms, that for a fixed set of graphs {H1, ..., H c… Expand

Is this relevant?

Highly Cited

1992

Highly Cited

1992

On etudie les liens entre les decompositions arborescentes d'hypergraphes introduites par Robertson et Seymour et les expressions… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

Researchers and Kids Participant Observation with Preschoolers Participant Observation with Preadolescents Participant… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

We prove that for every planar graph H there is a number w such that every graph with no minor isomorphic to H can be constructed… Expand

Is this relevant?