Two algorithms for valuated \(\Delta\)-matroids
type: Item
instance of: scholarly article
title: Two algorithms for valuated \(\Delta\)-matroids
zbMATH Open document ID: 0854.05022
DOI: 10.1016/0893-9659(96)00034-1
author: Kazuo Murota
published in: Applied Mathematics Letters
publication date: 1997-01-05T00:00:00Z
review text: Skew-symmetric matrices are considered where the entries are rational functions of a single variable with coefficients from a field. Two algorithms are presented for computing the maximum degree of a principal minor of given order of such a matrix. They are also valid for valued \(\Delta\)-matroids in general.
reviewed by: András Recski
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 915098
zbMATH Keywords: algorithms
zbMATH Keywords: principal minor
zbMATH Keywords: valued \(\Delta\)-matroids
MaRDI profile type: Publication
full work available at URL: 0893-9659(96)00034-1
OpenAlex ID: W2132181398
cites work: A greedy-algorithm characterization of valuated \(\Delta\)-matroids
cites work: Pfaffian forms and \(\Delta\)-matroids
cites work: Finding optimal minors of valuated bimatroids
cites work: Valuated matroids: A new look at the greedy algorithm
cites work: Well-layered maps---a class of greedily optimizable set functions
cites work: Well-layered maps and the maximum-degree \(k \times k\)-subdeterminant of a matrix of rational functions
cites work: Rewarding maps: On greedy optimization of set functions
cites work: Valuated Matroid Intersection I: Optimality Criteria
cites work: Valuated Matroid Intersection II: Algorithms
cites work: Matchings and \(\Delta\)-matroids
cites work: \(\Delta\)-matroids with the strong exchange conditions
cites work: Pseudomatroids
cites work: Computing the Degree of Determinants via Combinatorial Relaxation
description: scientific article; zbMATH DE number 915098