scientific article; zbMATH DE number 3575633

MaRDI QIDQ4148017zbMATH OpenFDO

Authors Richard Karp

Publication date 1975

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Graph theory (05C99) Algorithms in computer science (68W99)

Cited in

(7)

• The 2-quasi-greedy algorithm for cardinality constrained matroid bases
• COBLOC: A hierarchical method for blocking network data
• Generic case complexity of the graph isomorphism problem
• Isomorphism for random \(k\)-uniform hypergraphs
• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
• A state-of-the-art review of parallel-machine scheduling research
• An efficient fully polynomial approximation scheme for the Subset-Sum problem.

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 Q4148017)