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):
Displayed 4 items.
- 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)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (Q4454318) (← links)