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
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, 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, (d,1)-total labeling of graphs with a given maximum average degree, Fully dynamic arboricity maintenance, 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, Families of vectors with prescibed rank partition and a prescribed subfamily, Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups, Two results on the rank partition of a matroid, On the tractability of some natural packing, covering and partitioning problems, Odd decompositions and coverings of graphs, Indicated coloring of matroids, Linear choosability of graphs, Fast approximation of matroid packing and covering, Matrix choosability, The problem of multiple commons: a market design approach, A faster algorithm for packing branchings in digraphs, Forests, frames, and games: Algorithms for matroid sums and applications, Partitioning the bases of the union of matroids, The coloring game on matroids, Decomposing a graph into forests and a matching, On-line list coloring of matroids, Reliable assignments of processors to tasks and factoring on matroids, Subtree and substar intersection numbers, Factoriality condition of some nodal threefolds in \({\mathbb{P}^4}\), On the notion of generalized minor in topological network theory and matroids, Some results on visibility graphs, Some bounds on the injective chromatic number of graphs, Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties, A note on the arboricity of graphs, Minors of simplicial complexes, Binary multiples of combinatorial geometries. I, II, Edge-disjoint spanning trees and depth-first search, Partial matroid representations, Distances in orientations of graphs, On maximally distant spanning trees of a graph, Relative complexity of checking and evaluating, Two easy duality theorems for product partial orders, A combinatorial study of the rigidity of planar structures, The basis monomial ring of a matroid, Optimal matroid partitioning problems, The complexity of the matroid-greedoid partition problem, Minimum partition of an independence system into independent sets, Group connectivity and group coloring: small groups versus large groups, Structural theorems for submodular functions, polymatroids and polymatroid intersections, Approximations for the disjoint paths problem in high-diameter planar networks, Rooted \(k\)-connections in digraphs, Some recent results in combinatorial approaches to dynamical systems, Edge-decompositions of highly connected graphs into paths, Applications of matroid partition to tree decomposition, The Tutte polynomial via lattice point counting, Random sampling and greedy sparsification for matroid optimization problems, Sparse hypergraphs and pebble game algorithms, The \(\beta\)-assignment problems, Sparsity-certifying graph decompositions, On characterizations of rigid graphs in the plane using spanning trees, On the impossibility of decomposing binary matroids, The projective geometry of the Gale transform., Rigidity of multi-graphs. I: Linking rigid bodies in n-space, Testing membership in matroid polyhedra, Total weak unimodularity: Testing and applications, A branch and bound algorithm for symmetric 2-peripatetic salesman problems, Factoriality of complete intersections in \(\mathbb{P}^{5}\), List coloring of matroids and base exchange properties, Monotone path systems in simple regions, An integer analogue of Carathéodory's theorem
