Sciweavers

446 search results - page 8 / 90
» A Combinatorial Theorem for Trees
Sort
View
COMBINATORICS
2006
118views more  COMBINATORICS 2006»
14 years 9 months ago
Noncrossing Trees and Noncrossing Graphs
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
William Y. C. Chen, Sherry H. F. Yan
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
14 years 11 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
COMBINATORICA
2008
129views more  COMBINATORICA 2008»
14 years 9 months ago
The combinatorial encoding of disjoint convex sets in the plane
We introduce a new combinatorial object, the double-permutation sequence, and use it to encode a family of mutually disjoint compact convex sets in the plane in a way that capture...
Jacob E. Goodman, Richard Pollack
COMBINATORICS
1998
84views more  COMBINATORICS 1998»
14 years 9 months ago
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
André Bouchet