History


Help on query formulation
first | previous | 1 | next | last

Result 1 to 7 of 7 total

Cycles in graphs. (English)
Vöcking, Berthold (ed.) et al., Algorithms unplugged. Berlin: Springer (ISBN 978-3-642-15327-3/hbk; 978-3-642-15328-0/ebook). 77-88 (2011).
Classification: P50 R40 K30
1
Pledge’s algorithm ‒ how to escape from a dark maze. (English)
Vöcking, Berthold (ed.) et al., Algorithms unplugged. Berlin: Springer (ISBN 978-3-642-15327-3/hbk; 978-3-642-15328-0/ebook). 69-75 (2011).
Classification: P50 R40
2
Depth-first search (Ariadne \& co.). (English)
Vöcking, Berthold (ed.) et al., Algorithms unplugged. Berlin: Springer (ISBN 978-3-642-15327-3/hbk; 978-3-642-15328-0/ebook). 57-68 (2011).
Classification: P50 R40
3
NXT robots and mobile terminals in computer science education. (NXT-Roboter und mobile Endgeräte im Informatikunterricht.) (German)
Log In 27, No. 145, 44-51 (2007).
Classification: Q50 P60
4
Labyrinths. Report on an activity in grade 7, 2000-2001. (Labyrinthes. Compte rendu d’une activité menée dans une classe de cinquième, année 2000 - 2001.) (French)
Bull. APMEP, No. 439, 177-186 (2002).
Classification: D83
5
Mazes and labyrinths. (Mazes et labyrinthes.) (French)
Corol’aire, No. 39, 6-7 (1999).
Classification: A20
6
Modification of graph algorithms (from a deep search to a systematic search of the edges of graphs). (Modifikace grafových algoritmů (od prohledávání do hloubky k systematickému prohledávání hran grafu).) (Czech)
Mat. Fyz. Inform. 12, No. 8, 495-500 (2003).
Classification: K34
7
first | previous | 1 | next | last

Result 1 to 7 of 7 total

Valid XHTML 1.0 Transitional Valid CSS!