1729 search results - page 236 / 346 » Bound Graph Polysemy |
150
Voted
ADHOCNOW
2003
Springer
15 years 11 months ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
175
click to vote
GD
2001
Springer
15 years 10 months ago
2001
Springer
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
137
click to vote
ICCAD
1993
IEEE
15 years 10 months ago
1993
IEEE
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...
148
Voted
STOC
1990
ACM
15 years 10 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
158
Voted
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...