scientific article; zbMATH DE number 3896660

MaRDI QIDQ3675896zbMATH OpenFDO

Authors Günther Ruhe

Publication date 1984

zbMATH Keywords

cocycle matrixgraph realization problemm-hierarchies

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Linear programming (90C05)

Recommendations

• An Almost Linear-Time Algorithm for Graph Realization
• Uncovering generalized-network structure in matrices
• scientific article; zbMATH DE number 3862960
• An exact approach to the problem of extracting an embedded network matrix
• Extracting pure network submatrices in linear programs using signed graphs.

Cited in

(5)

• Computational implementation of Fujishige's graph realizability algorithm
• Extracting pure network submatrices in linear programs using signed graphs.
• Matrix approach to formulate and search k-ESS of graphs using the STP theory
• An Almost Linear-Time Algorithm for Graph Realization
• An approach to improving the Mayeda method for graph realization from a matrix

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3675896)