Results 91 to 100 of about 511 (171)
The principal minors of a matroid
, 1971 Kishi and Kajitani introduced the concepts of the principal partition of a graph and maximally distant forest pairs. These concepts lead to the determination of the topological degrees of freedom of a graph or, equivalently, the minimum hybrid rank of a ...
Weinberg, Louis +3 more
core +1 more source
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
Matroids with many common bases
Discrete Mathematics, 2003 The notion of ``vertical \(k\)-connectivity'' of matroids, due to Oxley, is utilized to formulate a strengthened version of a previous theorem of the author's. This new statement is proven: If the symmetric difference of the collections of bases of two matroids has at most \(k\) elements, then, except in certain simply-described cases, it is possible ...
openaire +2 more sources
Groups with the basis property
, 2011 "The first author is supported by an EPSRC Doctoral Training Grant"We study finite groups for which every minimal generating set has the same cardinality.
McDougall-Bagnall, Jonathan +4 more
core +1 more source
Generation of all randomizations using circuits. [PDF]
Ann Inst Stat Math, 2023 Pesce E +3 more
europepmc +1 more source
Topological Properties of Active Orders for Matroid Bases
, 2003 Las Vergnas [7] introduced several lattice structures on the bases of an ordered matroid M by using their external and internal activities. He also noted [8] that when computing the Möbius function of these lattices, it was often zero, although he had ...
Bruce E. Sagan, Rieuwert J. Blok
core
Incidence matrices, geometrical bases, combinatorial prebases and matroids
, 1998 For a relation A ⊆ (C × D), where C,D are two finite sets, and an ordering σ of C we construct a matroid M(σ) on the set D. For the relation A with the incidence matrix  we also define a geometrical basis with respect to F, where F is a subset of the ...
T.V. Alekseyevskaya +3 more
core +1 more source
Flip Distances Between Graph Orientations. [PDF]
Algorithmica, 2021 Aichholzer O +6 more
europepmc +1 more source
Matroid complexity and nonsuccinct descriptions [PDF]
, 2008 We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems under this scheme
Dillon Mayhew
core
Random Sampling and Greedy Sparsification for Matroid Optimization Problems.
, 1998 Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization, and demonstrate the effectiveness of ...
David R. Karger
core +1 more source