Sciweavers

144 search results - page 9 / 29
» Path extendability of claw-free graphs
Sort
View
SIAMDM
2010
128views more  SIAMDM 2010»
14 years 8 months ago
Permutation Capacities of Families of Oriented Infinite Paths
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
Graham Brightwell, Gérard D. Cohen, Emanuel...
VLDB
2002
ACM
106views Database» more  VLDB 2002»
14 years 9 months ago
Structure and Value Synopses for XML Data Graphs
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
Neoklis Polyzotis, Minos N. Garofalakis
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
14 years 11 months ago
Maximum Flows on Disjoint Paths
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
Guyslain Naves, Nicolas Sonnerat, Adrian Vetta
RECOMB
2005
Springer
15 years 10 months ago
Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks
Abstract. The interpretation of large-scale protein network data depends on our ability to identify significant sub-structures in the data, a computationally intensive task. Here w...
Jacob Scott, Trey Ideker, Richard M. Karp, Roded S...
96
Voted
WABI
2010
Springer
124views Bioinformatics» more  WABI 2010»
14 years 8 months ago
Improved Orientations of Physical Networks
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
Iftah Gamzu, Danny Segev, Roded Sharan