A linear algorithm for the all-bidirectional-edges problem on planar graphs
type: Item
instance of: scholarly article
title: A linear algorithm for the all-bidirectional-edges problem on planar graphs
zbMATH Open document ID: 0768.68173
DOI: 10.1007/BF01190896
author: P. B. Ramprasad
author: C. Pandu Rangan
published in: Algorithmica
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 168415
zbMATH Keywords: graph algorithms
zbMATH Keywords: all-bidirectional-edges problem
zbMATH Keywords: edge-labeling
zbMATH Keywords: path
zbMATH Keywords: planar graph
MaRDI profile type: Publication
cites work: Dividing a Graph into Triconnected Components
cites work: Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
cites work: Disjoint paths in graphs
cites work: A Polynomial Solution to the Undirected Two Paths Problem
full work available at URL: https://doi.org/10.1007/bf01190896
OpenAlex ID: W2066138488
description: scientific article; zbMATH DE number 168415