312 search results - page 13 / 63 » An experimental study on algorithms for drawing binary trees |
ALGORITHMICA
2010
13 years 7 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
GD
2004
Springer
14 years 26 days ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
AADEBUG
2005
Springer
14 years 1 months ago
2005
Springer
Dynamic slicing algorithms have been considered to aid in debugging for many years. However, as far as we know, no detailed studies on evaluating the benefits of using dynamic sl...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—Next generation internet protocol, IPv6, has attracted growing attention and has been deploying worldwide. With 128-bit address, IPv6 provides an extremely large address space a...