HTML
(27.43 kB)
Download
| Title Details: | |
|
Eulerian and Hamiltonian paths |
|
| Other Titles: |
Interactive application to find Euler and Hamilton paths |
| Authors: |
Georgiou, Dimitrios |
| Subject: | MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > DISCRETE STRUCTURES MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > DISCRETE STRUCTURES > GRAPHS AND TREES |
| Keywords: |
Graphs
Eulerian Paths Hamiltonian Paths Euleian Circuits Hamiltonian Circuits |
| Description: | |
| Abstract: |
Interactive application to identify routes or circuits that pass through each vertex of the graph only once to reach (or to not reach) the initial vertex of the route.
|
| Type: |
Interactive object |
| Creation Date: | 21-12-2015 |
| Item Details: | |
| License: |
http://creativecommons.org/licenses/by-nc-nd/3.0/gr |
| Spatial Coverage: |
Without spatial coverage |
| Temporal Coverage: |
Without time coverage |
| Handle | http://hdl.handle.net/11419/451 |
| Bibliographic Reference: | Georgiou, D. (2015). Eulerian and Hamiltonian paths [Interactive object]. In Georgiou, D., Antoniou, E., & Chatzimichailidis, A. 2015. Discrete Mathematical Structures in Computer Science [Undergraduate textbook]. Kallipos, Open Academic Editions. chapter 4. https://hdl.handle.net/11419/451 |
| Language: |
Greek |
| Is Part of: |
Mathematical Logic, Gates and Cercuits |
| Interactivity Level: |
low |
| Difficulty: |
low |
| Version: |
1st Edition |
| Publication Origin: |
Kallipos, Open Academic Editions |