Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
1969.
Network Flow, Transportation and Scheduling - Theory and Algorithms.
Vol. 57,
Issue. ,
p.
307.
Rajappan, K.P.
and
Stone, A.H.
1971.
On Okada's method for realizing cut-set matrices.
Journal of Combinatorial Theory, Series B,
Vol. 10,
Issue. 2,
p.
113.
Shiaw-Horng Chung
and
Roe, P.
1972.
An algorithm for the realization of general hybrid matrices for resistive multiports.
IEEE Transactions on Circuit Theory,
Vol. 19,
Issue. 5,
p.
436.
Spillers, W. R.
1975.
Optimization in Structural Design.
p.
3.
Weinberg, Louis
1977.
Matroids, generalized networks, and electric network synthesis.
Journal of Combinatorial Theory, Series B,
Vol. 23,
Issue. 1,
p.
106.
Murata, T.
1977.
Circuit theoretic analysis and synthesis of marked graphs.
IEEE Transactions on Circuits and Systems,
Vol. 24,
Issue. 7,
p.
400.
Towliati, Seyed-Youssef
and
Brown, David P.
1978.
A new algorithm for cut-set matrix synthesis.
Journal of the Franklin Institute,
Vol. 305,
Issue. 4,
p.
187.
Fujishige, Satoru
1980.
An efficient PQ-graph algorithm for solving the graph-realization problem.
Journal of Computer and System Sciences,
Vol. 21,
Issue. 1,
p.
63.
Soun, Y.
and
Truemper, K.
1980.
Single Commodity Representation of Multicommodity Networks.
SIAM Journal on Algebraic Discrete Methods,
Vol. 1,
Issue. 3,
p.
348.
Bixby, Robert E.
1981.
Computer-Assisted Analysis and Model Simplification.
p.
327.
Evans, James R.
1981.
Duality relationships between a class of graphs and linear programs.
International Journal of Mathematical Education in Science and Technology,
Vol. 12,
Issue. 3,
p.
257.
Cunningham, William H.
1982.
Separating cocircuits in binary matroids.
Linear Algebra and its Applications,
Vol. 43,
Issue. ,
p.
69.
Bixby, Robert E.
1984.
Progress in Combinatorial Optimization.
p.
39.
Spillers, William R.
1985.
Design Optimization.
p.
41.
Robertson, Neil
and
Seymour, P.D
1986.
Graph minors. V. Excluding a planar graph.
Journal of Combinatorial Theory, Series B,
Vol. 41,
Issue. 1,
p.
92.
Rotko, V. F.
1986.
Efficient algorithms for synthesizing graphs with given sets of fundamental cuts and cycles.
Cybernetics,
Vol. 22,
Issue. 1,
p.
42.
Iri, Masao
1987.
A very personal reminiscence on the problem of computational complexity.
Discrete Applied Mathematics,
Vol. 17,
Issue. 1-2,
p.
17.
Truemper, K.
1992.
Matroid Decomposition.
p.
350.
Ali, Agha Iqbal
and
Han, Hyun-Soo
1998.
Computational implementation of Fujishige's graph realizability algorithm.
European Journal of Operational Research,
Vol. 108,
Issue. 2,
p.
452.
Festa, Paola
2001.
Encyclopedia of Optimization.
p.
1909.