2503 search results - page 230 / 501 » A study of 3-arc graphs |
194
Voted
ITSSA
2006
15 years 6 months ago
2006
: Organization is a central concept in systems. In this paper an ant algorithm for detecting organizations is presented. In a discrete-time context, at each time-step, an organizat...
152
click to vote
KES
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. To find hidden features of co-authoring relationships, we focused on drawing techniques for bipartite graphs. We previously developed a drawing method called "anchor...
190
click to vote
JGAA
2007
15 years 6 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
173
click to vote
ACS
2000
15 years 6 months ago
2000
Abstract. We develop a general setting for the treatment of extensions of categories by means of freely adjoined morphisms. To this end, we study what we call composition graphs, i...
184
click to vote
CJ
1999
15 years 6 months ago
1999
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...