Sciweavers

CPC
2006
56views more  CPC 2006»
13 years 5 months ago
Rayleigh Matroids
A Rayleigh matroid is one which satisfies a set of inequalities analogous to the Rayleigh monotonicity property of linear resistive electrical networks. We show that every matroid...
Youngbin Choe, David G. Wagner
COMBINATORICS
2006
92views more  COMBINATORICS 2006»
13 years 5 months ago
Equitable Matroids
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
Dillon Mayhew
DM
2008
73views more  DM 2008»
13 years 5 months ago
Connectivity in frame matroids
We discuss the relationship between the vertical connectivity of a biased graph and the Tutte connectivity of the frame matroid of (also known as the bias matroid of ).
Daniel C. Slilaty, Hongxun Qin
DM
2010
108views more  DM 2010»
13 years 5 months ago
Internally 4-connected binary matroids with cyclically sequential orderings
We characterize all internally 4-connected binary matroids M with the property that the ground set of M can be ordered (e0, . . . , en-1) in such a way that {ei, . . . , ei+t} is 4...
Jeremy Aikin, Carolyn Chun, Rhiannon Hall, Dillon ...
ACID
2006
264views Algorithms» more  ACID 2006»
13 years 6 months ago
A Parameterized View on Matroid Optimization Problems
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
Dániel Marx