<?xml version="1.0" encoding="utf-8" ?> <rss version="2.0" xmlns:opensearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"> <channel> <title> <![CDATA[ Search for 'su:&quot;Graph algorithms&quot;']]> </title> <link> https://efind.ump.edu.my/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Graph%20algorithms%22&#38;sort_by=title_dsc&#38;format=rss </link> <atom:link rel="self" type="application/rss+xml" href="https://efind.ump.edu.my/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Graph%20algorithms%22&#38;sort_by=title_dsc&#38;format=rss"/> <description> <![CDATA[ Search results for 'su:&quot;Graph algorithms&quot;' at ]]> </description> <opensearch:totalResults>10</opensearch:totalResults> <opensearch:startIndex>0</opensearch:startIndex> <opensearch:itemsPerPage>30</opensearch:itemsPerPage> <atom:link rel="search" type="application/opensearchdescription+xml" href="https://efind.ump.edu.my/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Graph%20algorithms%22&#38;sort_by=title_dsc&#38;format=opensearchdescription"/> <opensearch:Query role="request" searchTerms="q%3Dccl%3Dsu%253A%2522Graph%2520algorithms%2522" startPage="" /> <item> <title> Shadow algorithms data miner / </title> <dc:identifier>ISBN:9781439880234</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=66719</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/1439880239.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Woo, Andrew.<br /> Boca Raton, FL : CRC Press, 2012 .<br /> xxi, 243 p. : 24 cm..<br /> 9781439880234 </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=66719">Place hold on <em>Shadow algorithms data miner /</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=66719</guid> </item> <item> <title> An improved algorithm for channel allocation on direct sequence spread spectrum / </title> <dc:identifier>ISBN:THE0003639(Local)</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=3165</link> <description> <![CDATA[ <p> By Handrizal.<br /> Kuantan, Pahang : UMP, 2011 .<br /> xiv, 92 p. : 30 cm. +.<br /> THE0003639(Local) </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=3165">Place hold on <em>An improved algorithm for channel allocation on direct sequence spread spectrum /</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=3165</guid> </item> <item> <title> Graphs, algorithms, and optimization : a practical approach / </title> <dc:identifier>ISBN:1584883960</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=22205</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/1584883960.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Kocay, William.<br /> Boca Raton: Chapman &amp; Hall/CRC, 2004 .<br /> xxvi, 932 p.: 26 cm..<br /> 1584883960 </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=22205">Place hold on <em>Graphs, algorithms, and optimization :</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=22205</guid> </item> <item> <title> Graph partitioning technique for separating nets in single-row networks / </title> <dc:identifier>ISBN:THE0002001(Local)</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=561</link> <description> <![CDATA[ <p> By Norazaliza Mohd Jamil.<br /> Skudai, Johor : UTM, 2007 .<br /> 90 p. : 30 cm..<br /> THE0002001(Local) </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=561">Place hold on <em>Graph partitioning technique for separating nets in single-row networks /</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=561</guid> </item> <item> <title> Graph neural networks : essentials and use cases / </title> <dc:identifier>ISBN:9783031885389</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=103951</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/3031885384.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> Cham : Springer, 2025 .<br /> 1 online resource 9783031885389 </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=103951">Place hold on <em>Graph neural networks :</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=103951</guid> </item> <item> <title> Graph algorithms and applications 5 / </title> <dc:identifier>ISBN:981256845X</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=36499</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/981256845X.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> Singapore ; | Hackensack, NJ : World Scientific, 2006 .<br /> x, 366 p. : , &quot;This book contains volume 8 of the Journal of graph algorithms and applications (JGAA)&quot;--Pref 25 cm..<br /> 981256845X </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=36499">Place hold on <em>Graph algorithms and applications 5 /</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=36499</guid> </item> <item> <title> Graph algorithms and applications 4 / </title> <dc:identifier>ISBN:9812568441</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=36498</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/9812568441.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> Singapore ; Hackensack, NJ : | World Scientific, 2006 .<br /> x, 427 p. : , &quot;This book contains volume 7 of the Journal of Graph Algorithms and Applications (JGAA)&quot;--Pref 25 cm..<br /> 9812568441 </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=36498">Place hold on <em>Graph algorithms and applications 4 /</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=36498</guid> </item> <item> <title> Graph algorithms and applications 3 / </title> <dc:identifier>ISBN:9812389393</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=36500</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/9812389393.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> Singapore ; | Hackensack, NJ : World Scientific, 2004 .<br /> x, 404 p. : , &quot;This book contains volume 6 of the Journal of graph algorithms and applications (JGAA)&quot;--Pref 25 cm..<br /> 9812389393 </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=36500">Place hold on <em>Graph algorithms and applications 3 /</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=36500</guid> </item> <item> <title> Graph algorithms and applications 2 / </title> <dc:identifier>ISBN:9812388559</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=36497</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/9812388559.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> Singapore : World Scientific , 2004 .<br /> xi, 521 p. : , &quot;Contains volumes 4-5 of the Journal of graph algorithms and applications (JGAA)&quot;--Pref 25 cm..<br /> 9812388559 </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=36497">Place hold on <em>Graph algorithms and applications 2 /</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=36497</guid> </item> <item> <title> Algorithmic aspects of graph connectivity / </title> <dc:identifier>ISBN:9780521878647 | 0521878640</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=62575</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/0521878640.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Nagamochi, Hiroshi.<br /> New York : Cambridge University Press, 2008 .<br /> xv, 375 p. : 25 cm..<br /> 9780521878647 | 0521878640 </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=62575">Place hold on <em>Algorithmic aspects of graph connectivity /</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=62575</guid> </item> </channel> </rss>
