The generalized column incidence graph and a matroid base-listing algorithm

DOI10.1080/03081088608817702zbMATH Open0606.05015OpenAlexW2037316150MaRDI QIDQ3744172FDOQ3744172

Authors: Mark S. Mummy 

Publication date: 1986

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081088608817702

Recommendations

• On the Complexity of Some Enumeration Problems for Matroids
• Full transversal matroids, strict gammoids, and the matroid components problem
• Finding all common bases in two matroids
• Algorithms and Computation
• On matroids and hierarchical graphs

zbMATH Keywords

algorithmTutte polynomialmatroid baseWhitney polynomialgeneralized column incidence graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The dependence graph for bases in matroids
• On the Abstract Properties of Linear Dependence
• Matroid basis graphs. I
• Two algorithms for matroids

Cited In (7)

• Output-sensitive algorithm for generating the flats of a matroid
• Title not available (Why is that?)
• Title not available (Why is that?)
• Strict matching matroids and matroid algorithms
• Full transversal matroids, strict gammoids, and the matroid components problem
• Algorithms and Computation
• Determining when a graphic matroid is transversal in linear time

This page was built for publication: The generalized column incidence graph and a matroid base-listing algorithm

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