601 search results - page 91 / 121 » Edge-dominating cycles in graphs |
ISBRA
2007
Springer
14 years 2 months ago
2007
Springer
The biological interpretation of large-scale gene expression data is one of the challenges in current bioinformatics. The state-of-theart approach is to perform clustering and then...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
ASPDAC
2006
ACM
14 years 2 months ago
2006
ACM
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
RECOMB
1999
Springer
14 years 27 days ago
1999
Springer
The abundance of information provided by completely sequenced genomes de nes a starting point for new insights in the multilevel organization of organisms and their evolution. At ...
CRITIS
2007
13 years 10 months ago
2007
Abstract In this paper we discuss the properties and algorithmic methods for the identification and classification of cyclical interdependencies in critical infrastructures based...