Relational depth-first-search with applications

DOI10.1016/S0020-0255(01)00163-3zbMath1004.68125MaRDI QIDQ1602553

Thorsten Hoffmann, Rudolf Berghammer

Publication date: 23 June 2002

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

relational specificationdepth-first method

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures, Relational characterisations of paths, Applying relation algebra and RelView to solve problems on orders and lattices, Cardinality of relations and relational approximation algorithms, Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures, Implementing Relational Specifications in a Constraint Functional Logic Language

Uses Software

• RelView
• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Two graph algorithms derived
• Dividing a Graph into Triconnected Components
• Functional programming with graphs
• Depth-First Search and Linear Graph Algorithms