From Matrices to Graphs
From MaRDI portal
Cited in
(11)- Graph minors. V. Excluding a planar graph
- A very personal reminiscence on the problem of computational complexity
- An efficient PQ-graph algorithm for solving the graph-realization problem
- Separating cocircuits in binary matroids
- Matroids, generalized networks, and electric network synthesis
- A new algorithm for cut-set matrix synthesis
- Computational implementation of Fujishige's graph realizability algorithm
- On Okada's method for realizing cut-set matrices
- Duality relationships between a class of graphs and linear programs
- Single Commodity Representation of Multicommodity Networks
- Nonseparating Cocircuits in Binary Matroids
This page was built for publication: From Matrices to Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5512792)