Sciweavers

3678 search results - page 162 / 736
» On the Stable Paths Problem
Sort
View
SIAMDM
2010
128views more  SIAMDM 2010»
15 years 4 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...
TON
2010
221views more  TON 2010»
15 years 1 months ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang
DAM
2007
131views more  DAM 2007»
15 years 6 months ago
Haplotyping with missing data via perfect path phylogenies
Computational methods for inferring haplotype information from genotype data are used in studying the association between genomic variation and medical condition. Recently, Gusfi...
Jens Gramm, Till Nierhoff, Roded Sharan, Till Tant...
SIGMOD
2005
ACM
150views Database» more  SIGMOD 2005»
16 years 6 months ago
Incremental Maintenance of Path Expression Views
Caching data by maintaining materialized views typically requires updating the cache appropriately to reflect dynamic source updates. Extensive research has addressed the problem ...
Arsany Sawires, Jun'ichi Tatemura, Oliver Po, Divy...
PODC
2006
ACM
16 years 14 days ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille