scientific article; zbMATH DE number 1230492

MaRDI QIDQ4222504zbMATH OpenFDO

Authors Madhumangal Pal

Publication date 9 March 1999

zbMATH Keywords

permutation grapharticulation points

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Some Efficient Algorithms for Permutation Graphs
• Efficient parallel algorithms for permutation graphs
• Finding articulation points of large graphs in linear time
• Parallel algorithms for permutation graphs
• Efficient parallel algorithms for bipartite permutation graphs
• An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs
• Optimal algorithms for computing articulation points and some related problems on a circular-arc graph
• An efficient algorithm for computing permanental polynomials of graphs
• scientific article; zbMATH DE number 4049081
• scientific article; zbMATH DE number 108587

Cited in

(5)

• An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs
• A linear time algorithm for finding all hinge vertices of a permutation graph
• L(0,1)-labelling of permutation graphs
• Some Efficient Algorithms for Permutation Graphs
• An efficient PRAM algorithm for maximum-weight independent set on permutation graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4222504)