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 Citation bot (talk | contribs) at 06:56, 16 August 2019 (Add: issue, author pars. 1-6. | You can use this bot yourself. Report bugs here.| Activated by User:Corvusphalanx). 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 (2011). The Art of Computer Programming, Volume 4A. Addison-Wesley Professional: Boston, MA, USA. p. 254,275.
  2. ^ Yoshinaka, Ryo; Saitoh, Toshiki; Kawahara, Jun; Tsuruma, Koji; Iwashita, Hiroaki; Minato, Shin-Ichi (2012). "Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs". Algorithms. 5 (2): 176–213. 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.
  • [1], A CWEB implementation by Donald Knuth.



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=911050318"