Sciweavers

3008 search results - page 600 / 602
» Independence in connected graphs
Sort
View
ORL
1998
68views more  ORL 1998»
13 years 7 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
SIAMDM
1998
89views more  SIAMDM 1998»
13 years 7 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky
SIAMAM
2010
119views more  SIAMAM 2010»
13 years 5 months ago
The Dynamics of Weakly Reversible Population Processes near Facets
This paper concerns the dynamical behavior of weakly reversible, deterministically modeled population processes near the facets (codimension-one faces) of their invariant manifolds...
David F. Anderson, Anne Shiu
WIOPT
2010
IEEE
13 years 5 months ago
Hub-betweenness analysis in delay tolerant networks inferred by real traces
—In this paper we study the influence of using hub nodes to relay messages in human-based delay tolerant networks (DTNs), by analyzing empirical traces obtained by human mobilit...
Giuliano Grossi, Federico Pedersini
BMCBI
2011
13 years 2 months ago
A lightweight, flow-based toolkit for parallel and distributed bioinformatics pipelines
Background: Bioinformatic analyses typically proceed as chains of data-processing tasks. A pipeline, or ‘workflow’, is a well-defined protocol, with a specific structure defin...
Marcin Cieslik, Cameron Mura