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

Progress on certifying algorithms

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

DOI10.1007/978-3-642-14553-7_1zbMATH Open1288.68242OpenAlexW1751538421MaRDI QIDQ3587331FDOQ3587331


Authors: K. Mehlhorn, P. Schweitzer Edit this on Wikidata


Publication date: 7 September 2010

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14553-7_1




Recommendations

  • Certifying algorithms
  • Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
  • scientific article; zbMATH DE number 2079335
  • A framework for the verification of certifying computations
  • On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency


Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01)



Cited In (2)

  • An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs
  • On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency





This page was built for publication: Progress on certifying algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587331)

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