Sciweavers

29 search results - page 2 / 6
» Note on alternating directed cycles
Sort
View
ARSCOM
1998
104views more  ARSCOM 1998»
13 years 7 months ago
A Note on the Road-Coloring Conjecture
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
E. Gocka, Walter W. Kirchherr, Edward F. Schmeiche...
LPAR
2004
Springer
14 years 21 days ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
14 years 26 days ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca

Publication
104views
14 years 9 months ago
Examining travel distances by walking and cycling, Montréal, Canada
Active transportation – especially walking and cycling – is undergoing a surge in popularity in urban planning and transportation circles as a solution to the environmental and...
Yasmin, F., Larsen, J. & El-Geneidy, A.
BMCBI
2007
148views more  BMCBI 2007»
13 years 7 months ago
p53FamTaG: a database resource of human p53, p63 and p73 direct target genes combining in silico prediction and microarray data
Background: The p53 gene family consists of the three genes p53, p63 and p73, which have polyhedral non-overlapping functions in pivotal cellular processes such as DNA synthesis a...
Elisabetta Sbisà, Domenico Catalano, Giorgi...