1053 search results - page 59 / 211 » On k-Path Covers and their applications |
PDP
2007
IEEE
14 years 3 months ago
2007
IEEE
The success of groupware software largely depends on its capability for being reused in different collaborative scenarios without requiring significant software development effort...
WG
2005
Springer
14 years 2 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
COMPGEOM
1994
ACM
14 years 1 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
BMCBI
2010
13 years 9 months ago
2010
Background: Modelling the ligand binding site of a protein is an important component of understanding proteinligand interactions and is being actively studied. Even if the side ch...
BMCBI
2010
13 years 9 months ago
2010
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...