On the vector representation of the reachability in planar directed graphs
type: Item
instance of: scholarly article
title: On the vector representation of the reachability in planar directed graphs
zbMATH Open document ID: 0302.05106
DOI: 10.1016/0020-0190(75)90019-8
author: S. Singh
published in: Information Processing Letters
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05-04
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 3472081
Wikidata QID: Q29013644
MaRDI profile type: Publication
full work available at URL: 0020-0190(75)90019-8
OpenAlex ID: W2031251427
cites work: Parallel concepts in graph theory
cites work: Q5585020
cites work: Some Theorems and Procedures for Loop-Free Routing in Directed Communication Networks
cites work: Efficient determination of the transitive closure of a directed graph
cites work: A transitive closure algorithm
cites work: Depth-First Search and Linear Graph Algorithms
description: scientific article; zbMATH DE number 3472081