356 search results - page 25 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
112
Voted
ALENEX
2009
15 years 1 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
136
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
91
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
101
Voted
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
ICC
2009
IEEE
15 years 7 months ago
2009
IEEE
—Repairing connectivity and achieving a certain level of fault tolerance are two important research challenges in wireless sensor networks that have, in many papers in the litera...