40 search results - page 8 / 8 » Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs |
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estima...
DAC
2006
ACM
14 years 5 months ago
2006
ACM
Steiner routing is a fundamental yet NP-hard problem in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing t...
ISBRA
2010
Springer
13 years 11 months ago
2010
Springer
d abstract), Nicola Ferraro, Luigi Palopoli, Simona Panni and Simona E. Rombo. Uncovering Hidden Phylogenetic Consensus d abstract), Nicholas Pattengale, Krister Swenson and Bernar...
BMCBI
2005
13 years 4 months ago
2005
Background: Accurate and automatic gene finding and structural prediction is a common problem in bioinformatics, and applications need to be capable of handling non-canonical spli...