Shortest Paths Avoiding Forbidden Subpaths (2009)
In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P...
Shortest Paths Avoiding Forbidden Subpaths (2009)
In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P...
Shortest Paths Avoiding Forbidden Subpaths (2009)
In this paper we study a variant of the shortest path problem in graphs: given a weighted graph $G$ and vertices $s$ and $t$, and given a set $X$ of forbidden paths in $G$, find a shortest $s$-$t$...
Shortest Paths Avoiding Forbidden Subpaths (2008)
In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that...
Approximation Algorithms for Shortest Descending Paths in Terrains (2008)
Ahmed, Mustaq, Das, Sandip, Lodha, Sachin, Lubiw, Anna, Maheshwari, Anil, Roy, Sasanka
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest...
Ordered Interval Routing Schemes (2008)
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any final revisions, as accepted by my examiners. I understand that my thesis may be made...
An Approximation Algorithm for Shortest Descending Paths (2007)
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest...
An Approximation Algorithm for Shortest Descending Paths (2007)
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest...
An Approximation Algorithm for Shortest Descending Paths (2007)
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest...
Ordered Interval Routing Schemes (2004)
An <i>Interval Routing Scheme (IRS)</i> represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges...
Ordered Interval Routing Schemes (2004)
An Interval Routing Scheme (IRS) represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with...
Ordered Interval Routing Schemes (2004)
An Interval Routing Scheme (IRS) represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with...
Ordered Interval Routing Schemes (2004)
An Interval Routing Scheme (IRS) represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with...
Ordered interal routing schemes [electronic resource] / (2004)
An Interval Routing Scheme (IRS) represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with...
Ordered Interval Routing Schemes (2004)
An Interval Routing Scheme (IRS) represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with...
Quantification of Homozygosity in Consanguineous Individuals with Autosomal Recessive Disease
Woods, C. Geoffrey, Cox, James, Springell, Kelly, Hampshire, Daniel J., Mohamed, Moin D., McKibbin, Martin, ...
Individuals born of consanguineous union have segments of their genomes that are homozygous as a result of inheriting identical ancestral genomic segments through both parents. One consequence of...
Quantification of Homozygosity in Consanguineous Individuals with Autosomal Recessive Disease
Woods, C. Geoffrey, Cox, James, Springell, Kelly, Hampshire, Daniel J., Mohamed, Moin D., McKibbin, Martin, ...
Individuals born of consanguineous union have segments of their genomes that are homozygous as a result of inheriting identical ancestral genomic segments through both parents. One consequence of...