Computational implementation of Fujishige's graph realizability algorithm

DOI10.1016/S0377-2217(97)00167-7zbMATH Open0943.90066OpenAlexW2008992164WikidataQ127230290 ScholiaQ127230290MaRDI QIDQ1296050FDOQ1296050

Authors: 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

Recommendations

• An Almost Linear-Time Algorithm for Graph Realization
• scientific article; zbMATH DE number 3896660
• scientific article; zbMATH DE number 3862960
• Computing the Strength of a Graph

zbMATH Keywords

transformationpreprocessinggraph realization(0,1) matrixhidden network

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

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

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

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