Pages that link to "Item:Q1142044"
From MaRDI portal
The following pages link to An efficient PQ-graph algorithm for solving the graph-realization problem (Q1142044):
Displayed 12 items.
- The structure of bases in bicircular matroids (Q912110) (← links)
- On the complexity of recognizing a class of generalized networks (Q1058995) (← links)
- Intersection graphs of paths in a tree (Q1077439) (← links)
- Decomposition and optimization over cycles in binary matroids (Q1089347) (← links)
- Layering strategies for creating exploitable structure in linear and integer programs (Q1117840) (← links)
- Recognizing hidden bicircular networks (Q1208462) (← links)
- A heuristic for finding embedded network structure in mathematical programmes (Q1261396) (← links)
- Computational implementation of Fujishige's graph realizability algorithm (Q1296050) (← links)
- Uncovering generalized-network structure in matrices (Q1308737) (← links)
- Distance realization problems with applications to internet tomography (Q1604199) (← links)
- On the efficiency of representability tests for matroids (Q1835922) (← links)
- The arborescence-realization problem (Q1893159) (← links)