686 search results - page 67 / 138 » Packing Cycles in Graphs |
126
click to vote
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
91
Voted
CIAC
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a representation with reflectional symmetry, which allows a roote...
119
Voted
ICCS
2009
Springer
15 years 7 months ago
2009
Springer
Irregular and sparse scientific computing programs frequently experience performance losses due to inefficient use of the memory system in most machines. Previous work has shown t...
86
Voted
BMCBI
2010
15 years 20 days ago
2010
Background: A protein binding hot spot is a small cluster of residues tightly packed at the center of the interface between two interacting proteins. Though a hot spot constitutes...
108
click to vote
PODC
2005
ACM
15 years 6 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...