Algorithms (Q5905704)

From MaRDI portal

Revision as of 15:23, 12 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 3471600

Language	Label	Description	Also known as
English	Algorithms	scientific article; zbMATH DE number 3471600

Statements

scholarly article

0 references

Algorithms (English)

0 references

Daniel J. Kleitman

0 references

Advances in Mathematics

0 references

publication date

1975

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

0 references

0 references

Expected time bounds for selection

0 references

Bounds on Multiprocessing Timing Anomalies

0 references

Efficient Planarity Testing

0 references

Optimal Computer Search Trees and Variable-Length Alphabetical Codes

0 references

A Method for the Construction of Minimum-Redundancy Codes

0 references

Algorithms for constructing graphs and digraphs with given valences and factors

0 references

0 references

Gaussian elimination is not optimal

0 references

On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)

0 references

A bad network problem for the simplex method and other minimum cost flow algorithms

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0001-8708(75)90153-X

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5905704

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5905704&oldid=34572330"