Hamiltonian path problem

Results: 50



#Item
1How Euler Did It by Ed Sandifer Knight’s Tour April 2006 It is sometimes difficult to imagine that Euler had a social life, but it is not surprising that he could find mathematics in what other people did for fun. He b

How Euler Did It by Ed Sandifer Knight’s Tour April 2006 It is sometimes difficult to imagine that Euler had a social life, but it is not surprising that he could find mathematics in what other people did for fun. He b

Add to Reading List

Source URL: eulerarchive.maa.org

Language: English - Date: 2013-11-04 12:20:24
2ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

Add to Reading List

Source URL: www.crypto.ethz.ch

Language: English - Date: 2015-04-20 05:14:26
3TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

Add to Reading List

Source URL: www.iwr.uni-heidelberg.de

Language: English - Date: 2013-06-19 04:16:58
4TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

Add to Reading List

Source URL: comopt.ifi.uni-heidelberg.de

Language: English - Date: 2013-06-19 04:16:58
5Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na

Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2012-04-20 08:45:09
6Cryptographic Protocols Spring 2015 Slides for Chapter 1 (6th lecture)  Hamiltonian cycles

Cryptographic Protocols Spring 2015 Slides for Chapter 1 (6th lecture) Hamiltonian cycles

Add to Reading List

Source URL: www.crypto.ethz.ch

Language: English - Date: 2015-03-30 06:00:41
7Microsoft PowerPoint - Presentation2

Microsoft PowerPoint - Presentation2

Add to Reading List

Source URL: web.cse.ohio-state.edu

Language: English - Date: 2009-01-27 18:47:33
8Discrete Applied Mathematics–399  Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam

Discrete Applied Mathematics–399 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2014-01-31 12:40:59
9CS681: Advanced Topics in Computational Biology Week 7 Lectures 2-3 Can Alkan EA224

CS681: Advanced Topics in Computational Biology Week 7 Lectures 2-3 Can Alkan EA224

Add to Reading List

Source URL: www.cs.bilkent.edu.tr

Language: English - Date: 2012-03-26 04:52:47
10The Longest Path Problem is Polynomial on Interval Graphs Kyriaki Ioannidou1? , George B. Mertzios2?? , and Stavros D. Nikolopoulos1? 1  2

The Longest Path Problem is Polynomial on Interval Graphs Kyriaki Ioannidou1? , George B. Mertzios2?? , and Stavros D. Nikolopoulos1? 1 2

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2009-06-12 14:16:54