On the efficiency of representability tests for matroids
type: Item
instance of: scholarly article
title: On the efficiency of representability tests for matroids
zbMATH Open document ID: 0505.05021
DOI: 10.1016/S0195-6698(82)80039-5
published in: European Journal of Combinatorics
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3795974
zbMATH Keywords: matroid representation
zbMATH Keywords: binary matroid
zbMATH Keywords: graphic matroid
zbMATH Keywords: polynomial time algorithms
author: Klaus Truemper
MaRDI profile type: Publication
cites work: Converting Linear Programs to Network Problems
cites work: Q4165400
cites work: An efficient PQ-graph algorithm for solving the graph-realization problem
cites work: Q3934405
cites work: The dependence graph for bases in matroids
cites work: The computational complexity of matroid properties
cites work: Decomposition of regular matroids
cites work: Recognizing graphic matroids
cites work: Functions of Bounded Second Variation and Stieltjes-Type Integrals
cites work: Alpha-balanced graphs and matrices and GF(3)-representability of matroids
cites work: On Whitney's 2‐isomorphism theorem for graphs
cites work: An Algorithm for Determining Whether a Given Binary Matroid is Graphic
cites work: Lectures on matroids
cites work: Q5638342
cites work: Q4111952
description: scientific article; zbMATH DE number 3795974