<![CDATA[ Search for 'su:"Connectivity" and su-to:Graph algorithms']]>

<![CDATA[ Search for 'su:"Connectivity" and su-to:Graph algorithms']]> http://opac.daiict.ac.in/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Connectivity%22%20and%20su-to%3AGraph%20algorithms&format=rss2 2 0 50 Shared-memory parallelism can be simple, fast, and scalable ISBN 9781970001884 http://opac.daiict.ac.in/cgi-bin/koha/opac-detail.pl?biblionumber=29104 By Shun, Julian. UK: Morgan & Claypool, 2017 . xv, 426 p. : 23.5 cm.. 9781970001884

Place Hold on Shared-memory parallelism can be simple, fast, and scalable

]]> http://opac.daiict.ac.in/cgi-bin/koha/opac-detail.pl?biblionumber=29104 Algorithmic aspects of graph connectivity ISBN 9780521878647 http://opac.daiict.ac.in/cgi-bin/koha/opac-detail.pl?biblionumber=17147 By Nagamochi, Hiroshi. New York: Cambridge University Press, 2008 . xv, 375 p.; 24 cm.. 9780521878647

Place Hold on Algorithmic aspects of graph connectivity

]]> http://opac.daiict.ac.in/cgi-bin/koha/opac-detail.pl?biblionumber=17147