An Initial-Algebra Approach to Directed Acyclic Graphs (1995)

by Jeremy Gibbons
Citations:5 - 0 self

Documents Related by Co-Citation

55 Revisiting Catamorphisms over Datatypes with Embedded Functions (or, Programs from Outer Space) – Leonidas Fegaras, Tim Sheard - 1996
14 The Treewidth of Java Programs – Jens Gustedt, Ole A. Mæhle, Jan Arne Telle - 2002
29 Functional Programming with Graphs – Martin Erwig - 1997
65 Automatic Generation of Linear-Time Algorithms from Predicate Calculus – R Borie, R Parker, C Tovey
73 Graph expressions and graph rewritings – M Bauderon, B
53 Structured Programs have Small Tree-Width and Good Register Allocation – Mikkel Thorup - 1995
68 An algebraic theory of graph reduction – Stefan Arnborg, et al. - 1993
7 Shorter paths to graph algorithms – B Moller, M Russling - 1994
20 Algorithms and Data Structures: Design, Correctness, Analysis – J H Kingston - 1990
3 der Woude. A relational theory of datatypes. Working document – C J Aarts, R C Backhouse, P Hoogendijk, E Voermans, J van - 1992
3 A General Scheme for Breadth-First Graph Traversal – Martin Russling - 1995
1 A class of graph algorithms. Qualifying dissertation for transfer to DPhil status – J N Ravelo - 1996
10 Calculating A Path Algorithm – Roland C. Backhouse, A. J. M. Van Gasteren - 1992
55 The weakest prespecification – C A R Hoare, J He - 1986
1404 A Discipline of Programming – E Dijkstra - 1976
474 Programming from Specifications – C C Morgan - 1994
53 Programming: the derivation of algorithms – A Kaldewaij - 1990
45 Graph Theory Applications – L R Foulds - 1992
8557 Introduction to Algorithms – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001