2503 search results - page 87 / 501 » A study of 3-arc graphs |
132
click to vote
IAT
2006
IEEE
16 years 4 days ago
2006
IEEE
Determining the performance of an organization is a must for both human and multi-agent organizations. The performance analysis enables organizations to uncover unexpected propert...
158
Voted
PAKDD
2004
ACM
15 years 11 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...
159
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an abili...
142
click to vote
WEA
2009
Springer
15 years 10 months ago
2009
Springer
We present initial results from the first empirical evaluation of a graph partitioning algorithm inspired by the Arora-Rao-Vazirani algorithm of [5], which combines spectral and ...
156
click to vote
FUZZY
2001
Springer
15 years 10 months ago
2001
Springer
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...