Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
From MaRDI portal
Publication:1313714
DOI10.1016/0020-0190(94)90053-1zbMath0787.68053MaRDI QIDQ1313714
S. Lakshmivarahan, Sudarshan K. Dhall, Y. Daniel Liang, Chongkye Rhee
Publication date: 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)90053-1
68Q25: Analysis of algorithms and problem complexity
68R05: Combinatorics in computer science
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs, Finding biconnected components in O(n) time for a class of graphs, An NC algorithm for the clique cover problem in cocomparability graphs and its application, Distance Labeling for Permutation Graphs
Cites Work