61 search results - page 4 / 13 » A chain theorem for matroids |
SIAMDM
2008
14 years 11 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
69
Voted
DCG
2000
14 years 11 months ago
2000
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...
101
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
The Shannon-McMillan-Breiman theorem asserts that the sample entropy of a stationary and ergodic stochastic process converges to the entropy rate of the same process almost surely...
87
Voted
ENGL
2007
14 years 11 months ago
2007
—The concept of ‘manipulability’ is particularly important to characterize the ability of a serial kinematic chain – artificial manipulator or natural limb – to move quic...
95
Voted
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...