The structure of bases in bicircular matroids

DOI10.1016/0166-218X(89)90017-6zbMath0698.05022OpenAlexW2100030821WikidataQ59592698 ScholiaQ59592698MaRDI QIDQ912110

M. L. Gardner, Alan Shuchat, James B. Orlin, Randy Shull

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(89)90017-6

zbMATH Keywords

recognition algorithmgeneralized network flow problemGNFPNFpure network flow problem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (5)

Recognizing a class of bicircular matroids ⋮ The structure of bases in bicircular matroids ⋮ Representations of bicircular matroids ⋮ Recognizing hidden bicircular networks ⋮ Uncovering generalized-network structure in matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on detecting simple redundancies in linear systems
• The structure of bases in bicircular matroids
• On the complexity of recognizing a class of generalized networks
• Connectivity in bicircular matroids
• An efficient PQ-graph algorithm for solving the graph-realization problem
• Signed graphs
• Representations of bicircular matroids
• On matroids on edge sets of graphs with connected subgraphs as circuits. II
• Partial matroid representations
• On subgraphs as matroid cells
• BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPH
• Extracting embedded generalized networks from linear programming problems
• Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
• An Almost Linear-Time Algorithm for Graph Realization
• New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
• Converting Linear Programs to Network Problems
• A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
• An efficient scaling procedure for gain networks
• A Flow Augmentation Approach to the Network with Gains Minimum Cost Flow Problem
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• BICIRCULAR MATROIDS
• Integrating network optimization capabilities into a high-level modeling language
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• On the Generalized Transportation Problem
• The Dual Method for the Generalized Transportation Problem
• Optimal Flow In A Network With Gains^*
• Basic Dual Feasible Solutions for a Class of Generalized Networks
• Optimization of the flow through networks with gains
• On the equivalence of some generalized network problems to pure network problems

This page was built for publication: The structure of bases in bicircular matroids