Sciweavers

4218 search results - page 568 / 844
» Complete sets of cooperations
Sort
View
105
Voted
JCT
2010
79views more  JCT 2010»
14 years 11 months ago
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
Maciej Kalkowski, Michal Karonski, Florian Pfender
101
Voted
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
14 years 11 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
SCP
2010
155views more  SCP 2010»
14 years 11 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
BMCBI
2010
100views more  BMCBI 2010»
14 years 10 months ago
New insights into protein-protein interaction data lead to increased estimates of the S. cerevisiae interactome size
Background: As protein interactions mediate most cellular mechanisms, protein-protein interaction networks are essential in the study of cellular processes. Consequently, several ...
Laure Sambourg, Nicolas Thierry-Mieg
135
Voted
BCB
2010
156views Bioinformatics» more  BCB 2010»
14 years 7 months ago
RepFrag: a graph based method for finding repeats and transposons from fragmented genomes
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
Nirmalya Bandyopadhyay, A. Mark Settles, Tamer Kah...