Uncovering generalized-network structure in matrices

DOI10.1016/0166-218X(93)90103-UzbMath0784.05044MaRDI QIDQ1308737

Donald K. Wagner, Collette R. Coullard, John G. del Greco

Publication date: 10 December 1993

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

zbMATH Keywords

polynomial-time algorithmbicircular matroidsgeneralized- network recognition problemgeneralized-network matrix

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Recognizing a class of bicircular matroids

Cites Work

• 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
• Representations of bicircular matroids
• Recognizing hidden bicircular networks
• On matroids on edge sets of graphs with connected subgraphs as circuits. II
• On subgraphs as matroid cells
• Combinatorial Algorithms for the Generalized Circulation Problem
• BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPH
• An Almost Linear-Time Algorithm for Graph Realization
• Converting Linear Programs to Network Problems
• BICIRCULAR MATROIDS
• Dividing a Graph into Triconnected Components
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Uncovering generalized-network structure in matrices