Sciweavers

216 search results - page 4 / 44
» Edge Search Number of Cographs in Linear Time
Sort
View
DM
2007
97views more  DM 2007»
13 years 7 months ago
Recognizing Cartesian products in linear time
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...
Wilfried Imrich, Iztok Peterin
ICCAD
2006
IEEE
95views Hardware» more  ICCAD 2006»
14 years 4 months ago
Timing model reduction for hierarchical timing analysis
— In this paper, we propose a timing model reduction algorithm for hierarchical timing analysis based on a bicliquestar replacement technique. In hierarchical timing analysis, ea...
Shuo Zhou, Yi Zhu, Yuanfang Hu, Ronald L. Graham, ...
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
13 years 9 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
WABI
2009
Springer
130views Bioinformatics» more  WABI 2009»
14 years 2 months ago
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions
It becomes more and more important to search for similar structures from molecular 3-D structure databases in the structural biology of the post genomic era. Two molecules are said...
Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 7 months ago
Parameterizing by the Number of Numbers
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
Michael R. Fellows, Serge Gaspers, Frances A. Rosa...