On the Complexity of Some Enumeration Problems for Matroids

Enumerative combinatorics (05A99) Combinatorial aspects of matroids and geometric lattices (05B35) Analysis of algorithms and problem complexity (68Q25)

Recommendations

The complexity of the matroid homomorphism problem
On the Complexity of Matroid Isomorphism Problems
On the number of matroids
On the number of matroids
Algorithms and Computation
Enumerating matroids of fixed rank
On the complexity of matroid isomorphism problem
On the generalization of the matroid parity problem
scientific article; zbMATH DE number 3370358
Some problems on approximate counting in graphs and matroids

Cited in

(50)

Jump number problem: The role of matroids
Matroid Steiner problems, the Tutte polynomial and network reliability
An inequality for polymatroid functions and its applications.
Computing the spark: mixed-integer programming for the (vector) matroid girth problem
On the complexity of solution extension of optimization problems
Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
Incremental delay enumeration: space and time
Linear codes over signed graphs
a-tint: a polymake extension for algorithmic tropical intersection theory
On the (co)girth of a connected matroid
Some hard problems on matroid spikes
On enumerating minimal dicuts and strongly connected subgraphs
Invited talks
Precision and sensitivity in detailed-balance reaction networks
On the Complexity of Matroid Isomorphism Problems
Matroid Complexity and Nonsuccinct Descriptions
scientific article; zbMATH DE number 3918383 (Why is no real title available?)
The generalized column incidence graph and a matroid base-listing algorithm
scientific article; zbMATH DE number 4095482 (Why is no real title available?)
Covering Vectors by Spaces: Regular Matroids
scientific article; zbMATH DE number 1929933 (Why is no real title available?)
scientific article; zbMATH DE number 1405693 (Why is no real title available?)
Listing induced Steiner subgraphs as a compact way to discover Steiner trees in graphs
Enumerating vertices of 0/1-polyhedra associated with 0/1-totally unimodular matrices
Output-sensitive algorithm for generating the flats of a matroid
Algorithms and Computation
Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
The complexity of deletion problems for matroids
ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
Enumerating Spanning and Connected Subsets in Graphs and Matroids
Monadic second-order model-checking on decomposable matroids
A combinatorial search problem on matroids
Min‐sum controllable risk problems with concave risk functions of the same value range
Polynomial-delay enumeration algorithms in set systems
Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders
Quantum algorithms for learning hidden strings with applications to matroid problems
On the complexity of enumerating pseudo-intents
Hardness and approximation of submodular minimum linear ordering problems
Polynomial-delay enumeration of large maximal common independent sets in two matroids
New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems
Trichotomies in the complexity of minimal inference
Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond
On the B-differential of the componentwise minimum of two affine vector functions
Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
On the enumeration of signatures of XOR-CNF's
From amortized to worst case delay in enumeration algorithms
Generating cut conjunctions in graphs and related problems
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
On the complexity of monotone dualization and generating minimal hypergraph transversals
Scientific contributions of Leo Khachiyan (a short overview)

This page was built for publication: On the Complexity of Some Enumeration Problems for Matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470804)