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.

2018

2018

NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and inter… Expand

Highly Cited

2014

Highly Cited

2014

A graph is 1-planar if it can be embedded in the plane with at most one crossing per edge. It is known that the problem of… Expand

Highly Cited

2007

Highly Cited

2007

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

2005

2005

In this paper we deal with the problem of computing upward two-page book embeddings of Two Terminal Series-Parallel (TTSP… Expand

2003

2003

In molecular biology, RNA structure comparison is of great i nterest to help solving problems as different as phylogeny… Expand

2001

2001

A book embedding of a graph consists of a linear ordering of the vertices along a line in 3-space (the spine), and an assignment… Expand

1998

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… Expand

Highly Cited

1989

Highly Cited

1989

A book embedding of a graph consists of an embedding of its nodes along the spine of a book (i.e., a linear ordering of the nodes… Expand

Highly Cited

1979

Highly Cited

1979

Abstract The book thickness bt(G) of a graph G is defined, its basic properties are delineated, and relations are given with… Expand