Sciweavers

3757 search results - page 107 / 752
» The overlap number of a graph
Sort
View
IJON
2007
90views more  IJON 2007»
14 years 10 months ago
Spatially organized spike correlation in cat visual cortex
Inspired by optical recordings from visual cortex which show maps of orientation selectivity, and the finding that very similar patterns of population activity occur when the neu...
Denise Berger, David Warren, Richard Normann, Amos...
ENTCS
2002
181views more  ENTCS 2002»
14 years 9 months ago
Alias verification for Fortran code optimization
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
Thi Viet Nga Nguyen, François Irigoin
SIAMDM
2008
148views more  SIAMDM 2008»
14 years 10 months ago
A New Algorithm for On-line Coloring Bipartite Graphs
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
Hajo Broersma, Agostino Capponi, Daniël Paulu...
DAM
2002
78views more  DAM 2002»
14 years 9 months ago
Uniquely 2-list colorable graphs
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
Yashar Ganjali, Mohammad Ghebleh, Hossein Hajiabol...
WABI
2007
Springer
139views Bioinformatics» more  WABI 2007»
15 years 4 months ago
Computability of Models for Sequence Assembly
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
Paul Medvedev, Konstantinos Georgiou, Gene Myers, ...