3267 search results - page 380 / 654 » Generalized quasirandom graphs |
190
click to vote
STACS
1991
Springer
15 years 10 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
175
Voted
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
143
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
The paper investigates the synchronization of a network of identical linear state-space models under a possibly time-varying and directed interconnection structure. The main resul...
171
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
185
click to vote
CCCG
1998
15 years 8 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...