Computational implementation of Fujishige's graph realizability algorithm

DOI10.1016/S0377-2217(97)00167-7zbMath0943.90066OpenAlexW2008992164WikidataQ127230290 ScholiaQ127230290MaRDI QIDQ1296050

Agha Iqbal Ali, Hyun-Soo Han

Publication date: 11 July 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00167-7

zbMATH Keywords

transformationpreprocessinggraph realization(0,1) matrixhidden network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Boolean programming (90C09)

Related Items (1)

Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient PQ-graph algorithm for solving the graph-realization problem
• Separating cocircuits in binary matroids
• Recognizing graphic matroids
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
• An Almost Linear-Time Algorithm for Graph Realization
• Converting Linear Programs to Network Problems
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• The Age of Optimization: Solving Large-Scale Real-World Problems
• From Matrices to Graphs

This page was built for publication: Computational implementation of Fujishige's graph realizability algorithm