In graph theory, the thickness of a graph G is the minimum number of planar graphs into which the edges of G can be partitioned. That is, if there… (More)

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

Highly Cited

2008

Highly Cited

2008

- Stephane Durocher, David G. Kirkpatrick, Lata Narayanan
- ICDCN
- 2008

We study the problem of routing in three-dimensional ad hoc networks. We are interested in routing algorithms that guarantee… (More)

Is this relevant?

2005

2005

- Vida Dujmovic, David R. Wood
- Graph Drawing
- 2005

Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours… (More)

Is this relevant?

2004

2004

- Christian A. Duncan, David Eppstein, Stephen G. Kobourov
- Symposium on Computational Geometry
- 2004

We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. All of our algorithms run in O… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- M. S. Fuhrer
- 2002

A high-mobility (9000 cm2/V‚s) semiconducting single-walled nanotube transistor is used to construct a nonvolatile charge-storage… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

The ropelength of a knot is the quotient of its length and its thickness, the radius of the largest embedded normal tube around… (More)

Is this relevant?

1998

1998

- Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
- J. Graph Algorithms Appl.
- 1998

We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Mark A Sussman, Emad Fatemiy, Peter Smerekaz, Stanley Osherx
- 1997

ÐA level set method for capturing the interface between two ¯uids is combined with a variable density projection method to allow… (More)

Is this relevant?

1997

1997

- Douglas N. Arnold, Franco Brezzi
- Math. Comput.
- 1997

We propose a new family of finite element methods for the Naghdi shell model, one method associated with each nonnegative integer… (More)

Is this relevant?

1995

1995

- Robert J. Cimikowski
- Inf. Sci.
- 1995

We present an empirical analysis of some heuristics for the graph thickness problem, i.e., decomposing a graph into the minimum… (More)

Is this relevant?

1991

1991

- Alice M. Dean, Joan P. Hutchinson, Edward R. Scheinerman
- J. Comb. Theory, Ser. B
- 1991

We prove that the thickness and the arboricity of a graph with e edges are at most Lfl3 + 3/2J and r~l, respectively, and that… (More)

Is this relevant?