scientific article; zbMATH DE number 3253793
From MaRDI portal
Publication:5540285
Cited in
(12)- An algorithm for finding a matroid basis which maximizes the product of the weights of the elements
- Generalized polymatroids and submodular flows
- The greedy algorithm for partially ordered sets
- A combinatorial optimization problem: optimal generalized cycle bases
- Self-similar solution of incompressible micropolar boundary layer flow over a semi-infinite plate
- Improved cycle bases for the flexibility analysis of structures
- The Painlevé III, V and VI transcendents as solutions of the Einstein-Weyl equations
- A greedy algorithm for solving a certain class of linear programmes
- Einige Aspekte in der Zuordnungstheorie
- Revised Greedy algorithm for formation of a minimal cycle basis of a graph
- A comparative study of algorithms for minimal cycle bases for efficient force method of frame analysis
- Persistency in combinatorial optimization problems on matroids
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 Q5540285)
