686 search results - page 100 / 138 » Packing Cycles in Graphs |
147
Voted
ICALP
2009
Springer
16 years 28 days 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...
88
Voted
ASPDAC
2006
ACM
15 years 6 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...
128
Voted
RECOMB
1999
Springer
15 years 4 months 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
15 years 2 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...
118
Voted
WIOPT
2010
IEEE
14 years 11 months ago
2010
IEEE
—Opportunistic forwarding is a simple scheme for packet routing in ad hoc wireless networks such as duty cycling sensor networks in which reducing energy consumption is a princip...