COCOON
2005
Springer
14 years 7 months ago
2005
Springer
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing...
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
By considering a new metric, Nikov and Nikova defined the class of error-set correcting codes. These codes differ from the errorcorrecting codes in the sense that the minimum dis...
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
Recently, several studies taking into account the ability for a gene to be absent or to have some copies in genomes have been proposed, as the examplar distance [11, 6] or the gene...
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. We consider the number of different ways to divide a rectangle containing n noncorectilinear points into smaller rectangles by n non-intersecting axis-parallel segments,...