On the vector representation of the reachability in planar directed graphs

DOI10.1016/0020-0190(75)90019-8zbMath0302.05106OpenAlexW2031251427WikidataQ29013644 ScholiaQ29013644MaRDI QIDQ1215513

S. Singh

Publication date: 1975

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(75)90019-8

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

A data structure for lattice representation, Dynamic maintenance of planar digraphs, with applications, REACHABILITY ON SUFFIX TREE GRAPHS, Area requirement and symmetry display of planar upward drawings, Dynamic reachability in planar digraphs with one source and one sink, Join-reachability problems in directed graphs

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• Efficient determination of the transitive closure of a directed graph
• Some Theorems and Procedures for Loop-Free Routing in Directed Communication Networks
• A transitive closure algorithm
• Depth-First Search and Linear Graph Algorithms