A linear algorithms for the two paths problem on permutation graphs
type: Item
instance of: scholarly article
title: A linear algorithms for the two paths problem on permutation graphs
zbMATH Open document ID: 0845.05085
author: C. P. Gopalakrishnan
author: C. Pandu Rangan
published in: Discussiones Mathematicae Graph Theory
publication date: 1996-08-26T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 890705
zbMATH Keywords: bridge
zbMATH Keywords: connectivity
zbMATH Keywords: disjoint paths
zbMATH Keywords: two paths problem
zbMATH Keywords: algorithm
zbMATH Keywords: permutation graph
MaRDI profile type: Publication
full work available at URL: dmgt.1013
OpenAlex ID: W2082093835
DOI: 10.7151/DMGT.1013
Recommended article: Q4732130
Recommended article: Linear structure of bipartite permutation graphs and the longest path problem
Recommended article: An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs
Recommended article: Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Recommended article: STACS 2004
Recommended article: Solving the 2-disjoint paths problem in nearly linear time
Recommended article: Q4028893
Recommended article: An efficient algorithm to find next-to-shortest path on permutation graphs
Recommended article: LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS
Recommended article: Solving the shortest-paths problem on bipartite permutation graphs efficiently
description: scientific article; zbMATH DE number 890705