514 search results - page 60 / 103 » Drawing a Graph in a Hypercube |
134
click to vote
SODA
2010
ACM
15 years 2 months ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
122
click to vote
CIKM
1997
Springer
15 years 8 months ago
1997
Springer
CT This paper explores several methods for visualizing the thematic content of large document collections. As opposed to traditional query-driven document retrieval, these methods ...
126
click to vote
GD
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
121
click to vote
GD
1998
Springer
15 years 8 months ago
1998
Springer
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 with straightline edges and assign each edge to a lay...
129
Voted
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
An n-bit (cyclic) Gray code is a (cyclic) sequence of all n-bit strings such that consecutive strings differ in a single bit. We describe an algorithm which for every positive int...