123 search results - page 4 / 25 » Graph Orientation Algorithms to Minimize the Maximum Outdegr... |
PPL
2000
13 years 5 months ago
2000
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— This paper investigates the path protection problem in mesh networks under multiple generic risks. Disjoint logical links may fail simultaneously if they share the same compone...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
CATS
2006
13 years 6 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...