Minimum partition of a matroid into independent subsets
From MaRDI portal
Publication:5586413
DOI10.6028/JRES.069B.004zbMath0192.09101WikidataQ100604519 ScholiaQ100604519MaRDI QIDQ5586413
Publication date: 1965
Published in: Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
On Generic Rigidity in the Plane ⋮ Network transformations and bounding network reliability ⋮ Frameworks with Coordinated Edge Motions ⋮ Systems of diagonal Diophantine inequalities ⋮ Algorithms for finding a rooted \((k,1)\)-edge-connected orientation ⋮ An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm ⋮ Keldysh Chains and Factorizations of Matrix Polynomials ⋮ Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems— ⋮ Infinite Matroids ⋮ Strength and reinforcement of a network and tree packing ⋮ Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations ⋮ Matroidal connectivity and conditional matroidal connectivity of star graphs ⋮ On the revealed preference analysis of stable aggregate matchings ⋮ Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ A deterministic parallel reduction from weighted matroid intersection search to decision ⋮ On Fair Division under Heterogeneous Matroid Constraints ⋮ Enhancing fault tolerance of balanced hypercube networks by the edge partition method ⋮ Arboricity games: the core and the nucleolus ⋮ Blocking and anti-blocking pairs of polyhedra ⋮ Theory of Principal Partitions Revisited ⋮ Packing and covering with integral feasible flows in integral supply-demand networks ⋮ Common Partial Transversals and Integral Matrices ⋮ Matroid intersection algorithms ⋮ A Constructive Arboricity Approximation Scheme ⋮ Unnamed Item ⋮ Generalized networks: Networks embedded on a matroid, part I ⋮ A forbidden substructure characterization of Gauss codes ⋮ Generalized networks: Networks embedded on a matroid, part II ⋮ Transversal matroid intersections and related packings ⋮ Branch and cut methods for network optimization ⋮ The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion ⋮ Quadratic diophantine inequalities ⋮ Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint) ⋮ The greedy travelling salesman's problem ⋮ Unnamed Item ⋮ Orientations of infinite graphs with prescribed edge-connectivity ⋮ The computational complexity of matroid properties ⋮ The chromatic number of random Cayley graphs ⋮ Rigid frameworks with dilation constraints ⋮ Degree-constrained orientations of embedded graphs ⋮ A short proof of a min–max relation for the bases packing of a matroid ⋮ Non-preemptive tree packing ⋮ Min-Max partitioning problem with matroid constraint ⋮ Cyclic orderings of paving matroids ⋮ (d,1)-total labeling of graphs with a given maximum average degree ⋮ Fully dynamic arboricity maintenance ⋮ Enabling high reliability via matroidal connectivity and conditional matroidal connectivity on arrangement graph networks ⋮ Non-preemptive tree packing ⋮ On the acyclic choosability of graphs ⋮ Decompositions of highly connected graphs into paths of length 3 ⋮ Claw‐decompositions and tutte‐orientations ⋮ Anti-blocking polyhedra ⋮ Packing algorithms for arborescences (and spanning trees) in capacitated graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Edmonds polytopes and a hierarchy of combinatorial problems ⋮ The rank formula of Nash-Williams as a source of covering and packing theorems ⋮ Applications of matroids in electric network theory ⋮ On partitioning two matroids into common independent subsets ⋮ Integer Rounding for Polymatroid and Branching Optimization Problems ⋮ A characterisation of the generic rigidity of 2-dimensional point-line frameworks ⋮ On the toric ideals of matroids of a fixed rank ⋮ Sensitivity analysis for symmetric 2-peripatetic salesman problems ⋮ Avoider-Enforcer games ⋮ The principal partition of a pair of graphs and its applications ⋮ Extensions of matroid covering and packing ⋮ Fast approximation for computing the fractional arboricity and extraction of communities of a graph ⋮ On blockwise symmetric signatures for matchgates ⋮ An application of simultaneous diophantine approximation in combinatorial optimization ⋮ Simultaneous diagonal congruences ⋮ On factorial double solids with simple double points ⋮ Pseudomatroids ⋮ Cuts, matrix completions and graph rigidity ⋮ Factorial hypersurfaces in \(\mathbb{P}^4\) with nodes ⋮ Ordering of the elements of a matroid such that its consecutive w elements are independent ⋮ Antistrong digraphs ⋮ Edge-packings of graphs and network reliability ⋮ Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity) ⋮ Generalized polymatroids and submodular flows ⋮ Efficient computation of implicit representations of sparse graphs ⋮ On the spanning tree polyhedron ⋮ Simple push-relabel algorithms for matroids and submodular flows ⋮ Flows and generalized coloring theorems in graphs ⋮ On density-critical matroids ⋮ Regularity of symbolic powers and arboricity of matroids ⋮ On certain polytopes associated with graphs ⋮ A generalized-polymatroid approach to disjoint common independent sets in two matroids ⋮ Improved bound for the Carathéodory rank of the bases of a matroid ⋮ Cyclic orderings and cyclic arboricity of matroids ⋮ Cliques in dense GF(\(q\))-representable matroids ⋮ Graph varieties in high dimension ⋮ Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs ⋮ 2-linked graphs ⋮ Implementation of a unimodularity test ⋮ On decomposing a hypergraph into \(k\) connected sub-hypergraphs ⋮ Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs ⋮ Circular flow on signed graphs ⋮ Decomposing a graph into bistars ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Decomposing graphs into paths of fixed length
This page was built for publication: Minimum partition of a matroid into independent subsets
