Sciweavers

149 search results - page 16 / 30
» Crossing Numbers and Parameterized Complexity
Sort
View
147
Voted
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
15 years 1 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
ECOOP
2008
Springer
15 years 5 months ago
Safe Cross-Language Inheritance
Inheritance is a standard means for reuse and for interfacing with external libraries. In a multi-language software product, extending a class written in a statically-typed languag...
Kathryn E. Gray
137
Voted
BMCBI
2011
14 years 10 months ago
CODA (CrossOver Distribution Analyzer): quantitative characterization of crossover position patterns along chromosomes
Background: During meiosis, homologous chromosomes exchange segments via the formation of crossovers. This phenomenon is highly regulated; in particular, crossovers are distribute...
Franck Gauthier, Olivier C. Martin, Matthieu Falqu...
128
Voted
AI
2010
Springer
15 years 3 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
COCOON
2009
Springer
15 years 10 months ago
Graph-Based Data Clustering with Overlaps
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
Michael R. Fellows, Jiong Guo, Christian Komusiewi...