From Matrices to Graphs

DOI10.4153/CJM-1964-011-0MaRDI QIDQ5512792zbMATH OpenFDO

Authors William T. Tutte

Publication date 1964

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1964-011-0

zbMATH Keywords

topology

Cited in

(11)

• A very personal reminiscence on the problem of computational complexity
• A new algorithm for cut-set matrix synthesis
• Separating cocircuits in binary matroids
• Graph minors. V. Excluding a planar graph
• Computational implementation of Fujishige's graph realizability algorithm
• Nonseparating Cocircuits in Binary Matroids
• Duality relationships between a class of graphs and linear programs
• An efficient PQ-graph algorithm for solving the graph-realization problem
• Matroids, generalized networks, and electric network synthesis
• Single Commodity Representation of Multicommodity Networks
• On Okada's method for realizing cut-set matrices

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)