Pages that link to "Item:Q1313714"
From MaRDI portal
The following pages link to Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs (Q1313714):
Displaying 14 items.
- A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118) (← links)
- An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218) (← links)
- Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time (Q763538) (← links)
- Recognizing breadth-first search trees in linear time (Q911287) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Finding biconnected components in O(n) time for a class of graphs (Q1350120) (← links)
- An NC algorithm for the clique cover problem in cocomparability graphs and its application (Q1351615) (← links)
- Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations (Q2876591) (← links)
- Additive tree 2-spanners of permutation graphs (Q3396414) (← links)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- Some Efficient Algorithms for Permutation Graphs (Q4290917) (← links)
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (Q4454318) (← links)
- Shorter Labeling Schemes for Planar Graphs (Q5866447) (← links)
- Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)
