Why Us? >>

  • - Open Access
  • - Peer-reviewed
  • - Rapid publication
  • - Lifetime hosting
  • - Free indexing service
  • - Free promotion service
  • - More citations
  • - Search engine friendly

Free SCIRP Newsletters>>

Add your e-mail address to receive free newsletters from SCIRP.

 

Contact Us >>

WhatsApp  +86 18163351462(WhatsApp)
   
Paper Publishing WeChat
Book Publishing WeChat
(or Email:book@scirp.org)

Article citations

More>>

S. Pemmaraju and S. Skiena, “All-Pairs Shortest Paths and Transitive Closure and Reduction. In: Computational Discrete Mathematics: Combinatorics and Graph Theory in Mathematica. Cambridge, England, Cambridge University Press, 2003. pp. 330-331 and 353-356.

has been cited by the following article: