Finding the closed partition of a planar graph

DOI10.1007/BF01293266zbMath0804.68108MaRDI QIDQ1322561

Vijaya Ramachandran, Honghua Yang

Publication date: 5 May 1994

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

directed graphsequential algorithmplanar graphprogram verificationdual graphstrongly connected componentclosed partitioncompact digraph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Topologically trivial closed walks in directed surface graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Verification of multiprocess probabilistic protocols
• Computing an st-numbering
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Efficient Planarity Testing
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Finding the closed partition of a planar graph