1215 search results - page 166 / 243 » Combinatorics |
COCOON
2005
Springer
15 years 3 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
15 years 3 months ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Floorplan is a crucial estimation task in the modern layout design of systems on chips. The paper presents a novel theoretical upper bound for slicing floorplans with soft modules...
COCOON
2004
Springer
15 years 3 months ago
2004
Springer
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the com
CPM
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper presents an elementary proof of the HannenhalliPevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the vari...