Sciweavers

388 search results - page 65 / 78
» On the Number of Cycles in Planar Graphs
Sort
View
BMCBI
2007
127views more  BMCBI 2007»
13 years 8 months ago
Characterization of protein-interaction networks in tumors
Background: Analyzing differential-gene-expression data in the context of protein-interaction networks (PINs) yields information on the functional cellular status. PINs can be for...
Alexander Platzer, Paul Perco, Arno Lukas, Bernd M...
ISAAC
2001
Springer
118views Algorithms» more  ISAAC 2001»
14 years 10 days ago
On Adaptive Fault Diagnosis for Multiprocessor Systems
Abstract. We first consider adaptive serial diagnosis for multiprocessor systems. We present an adaptive diagnosis algorithm using N + t − 1 tests, which is the smallest possibl...
Kumiko Nomura, Toshinori Yamada, Shuichi Ueno
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
14 years 1 months ago
PCG: a foothold selection algorithm for spider robot locomotion in 2D tunnels
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
Amir Shapiro, Elon Rimon
ICALP
2001
Springer
14 years 11 days ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
IWPEC
2009
Springer
14 years 2 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...