Jump to content

Knuth's Simpath algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Michael Hardy (talk | contribs) at 15:00, 29 July 2014 (→top: "zero" does not require a capital initial letter.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Simpath is an algorithm introduced by Donald Knuth that constructs a zero-suppressed decision diagram (ZDD) representing all simple paths between two vertices in a given graph.[1][2]

References

  1. ^ Knuth, Donald (2009). The Art of Computer Programming, Volume 4, Fascicle 1. Addison-Wesley Professional: Boston, MA, USA.
  2. ^ "Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs". Algorithms. 5: 176–213. 2012. doi:10.3390/a5020176.{{cite journal}}: CS1 maint: unflagged free DOI (link)
Wikiquote has quotations related to Knuth's Simpath algorithm.
Wikimedia Commons has media related to Donald Ervin Knuth.
  • Graphillion library which implements the algorithm for manipulating large sets of paths and other structures.
Stub icon

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Knuth%27s_Simpath_algorithm&oldid=618981697"