Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3575633

From MaRDI portal
Publication:4148017
Jump to:navigation, search

zbMATH Open0369.05049MaRDI QIDQ4148017FDOQ4148017


Authors: Richard Karp Edit this on Wikidata


Publication date: 1975



Title of this publication is not available (Why is that?)




Mathematics Subject Classification ID

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



Cited In (7)

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





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4148017&oldid=17951277"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 10:07. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki