Good on describing graph theory algorithms but is rendered bad due to that literate programming ... Simple algorithmic notation would have made the book much better.
This book's title is very misleading, as the author's focus really is on subgraph problems (e.g.
I'm pleased with the text in this book; the descriptions are almost all clear, and reading through the book gives me insight into some more interesting problems in trees and graphs. The high points of the book are its treaments of tree and graph isomorphism, but I also found the discussions of non-traditional traversal algorithms on trees and graphs very interesting.
Gabriel Jackson
Thomas-Gabriel Rüdiger
Gabriel Arrais
Gabriel Otieno Okello
Gabriel Kay
Gabriel Debenedetti
Jasmine Gabriel
Gabriel Conte
Gabriel Eljaiek-Rodríguez
Gabriel Jonsson
Gabriel Schwake
Gabriel Mayorga
Gabriel Jean
Gabriel Hawawini
Gabriel Goldberg
Gabriel Howell
Gabriel Webber Ziero
Gabriel Rogers
Gabriel Moulin
Victor Valiente
T. Gabriel
Gabriel Tavis
Gabriel A. Almond
Gabriel Ndayishimiye
Gabriel Hauser
Gabriel M. Filippelli
Gabriel Hauser
Gabriel Diaz Maggioli
Gabriel Cazeau
Gabriel Conte
Gabriel Arquilevich
Rebecca Gabriel
Gabriel Evangelou
Gabriel Barreto Bentin
Ionuţ Gabriel Ghionea
Deanna Gabriel Vierck
Marius Gabriel
Gabriel Glickman
Gabriel Frugone
Gabriel Ivbijaro
Christoph Gabriel
Vejas Gabriel Liulevicius
Gabriel Morel
Marius Gabriel
Gabriel Jaime AVENDAÑO AGUIRRE
Gabriel Alberto Letaif
Gabriel Ratcliffe
Casa Valiente
Juan Gabriel Vasquez
Gabriel Wolf
Liviu Gabriel Cretu
Gabriel Wüldenmar Ortiz
Gabriel Dixon
Gabriel Folorunso
Lucy Valiente
Gabriel Dery
Gert de Roo
R. G. Garside
Andrzej M. J. Skulimowski
Stefka Fidanova
Frank Hopfgartner
Estelle Maryline Delpech
Hsiang-Chuan Liu
Stefka Fidanova
Geoffrey Leech
Volker Eyert
James P. Denier
Martin Charles Golumbic
Gilbert Harman
Robert A. Meyers
ICCSA 2010 (2010 Fukuoka-shi, Japan)
Christine L. Mumford
Hermann Haken
International Conference on Computational Linguistics (15th 1992 Nantes, France)