Computational implementation of Fujishige's graph realizability algorithm
From MaRDI portal
Publication:1296050
Recommendations
Cites work
- scientific article; zbMATH DE number 3862960 (Why is no real title available?)
- scientific article; zbMATH DE number 3179032 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- An Almost Linear-Time Algorithm for Graph Realization
- An efficient PQ-graph algorithm for solving the graph-realization problem
- Converting Linear Programs to Network Problems
- Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
- From Matrices to Graphs
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Recognizing graphic matroids
- Separating cocircuits in binary matroids
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Age of Optimization: Solving Large-Scale Real-World Problems
Cited in
(1)
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)