Relational depth-first-search with applications
type: Item
instance of: scholarly article
title: Relational depth-first-search with applications
zbMATH Open document ID: 1004.68125
DOI: 10.1016/S0020-0255(01)00163-3
author: Rudolf Berghammer
author: Thorsten Hoffmann
published in: Information Sciences
publication date: 2002-06-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1758157
zbMATH Keywords: relational specification
zbMATH Keywords: depth-first method
describes a project that uses: RelView
describes a project that uses: Haskell
MaRDI profile type: Publication
cites work: Q3619797
cites work: Functional programming with graphs
cites work: Dividing a Graph into Triconnected Components
cites work: Two graph algorithms derived
cites work: Q5287518
cites work: Depth-First Search and Linear Graph Algorithms
Recommended article: Depth-First Search with P Systems
Recommended article: Depth-first search in directed planar graphs, revisited
Recommended article: Depth-First Search in Directed Planar Graphs, Revisited
Recommended article: Depth-First Search and Kuratowski Subgraphs
Recommended article: Parallel Depth-First Search in General Directed Graphs
Recommended article: Q4356435
Recommended article: The tree projection theorem and relational query processing
Recommended article: The complexity of dependency detection and discovery in relational databases
description: scientific article; zbMATH DE number 1758157