10608 search results - page 308 / 2122 » Complexity of O'Hara's Algorithm |
127
Voted
AB
2008
Springer
15 years 7 months ago
2008
Springer
Boolean networks (BNs) are known as a mathematical model of genetic networks. In this paper, we overview algorithmic aspects of inference, analysis and control of BNs while focusin...
115
click to vote
WEBI
2007
Springer
15 years 6 months ago
2007
Springer
Detecting densely connected subgroups in graphs such as communities in social networks is of interest in many research fields. Several methods have been developed to find commun...
101
Voted
ICCNMC
2005
Springer
15 years 6 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
103
Voted
WDAG
2001
Springer
2001
Springer
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
15 years 5 months ago
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space c...
COCOON
1999
Springer
15 years 5 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...