3268 search results - page 246 / 654 » The hub number of a graph |
173
click to vote
PAKDD
2004
ACM
15 years 12 months ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
144
click to vote
ISAAC
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
154
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Many segmentation algorithms describe images in terms of a hierarchy of regions. Although such hierarchies can produce state of the art segmentations and have many applications, th...
131
Voted
GD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...
139
click to vote
ICRA
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper we deal with the problem of allocating a given number of tokens, so as to maximize the firing rate of a cyclic event graph with deterministic transition firing delay...