From Matrices to Graphs

From MaRDI portal

Revision as of 03:13, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5512792

Jump to:navigation, search

DOI10.4153/CJM-1964-011-0zbMath0138.19202MaRDI QIDQ5512792

William T. Tutte

Publication date: 1964

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

zbMATH Keywords

Related Items (11)

Single Commodity Representation of Multicommodity Networks ⋮ 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 ⋮ On Okada's method for realizing cut-set matrices ⋮ Duality relationships between a class of graphs and linear programs ⋮ Computational implementation of Fujishige's graph realizability algorithm ⋮ Nonseparating Cocircuits in Binary Matroids

This page was built for publication: From Matrices to Graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5512792&oldid=30080200"