Pages that link to "Item:Q4290917"
From MaRDI portal
The following pages link to Some Efficient Algorithms for Permutation Graphs (Q4290917):
Displaying 16 items.
- A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs (Q868392) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- Connected domination and Steiner set on weighted permutation graphs (Q1190520) (← links)
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs (Q1313714) (← links)
- Planar stage graphs: Characterizations and applications (Q1392202) (← links)
- An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs (Q1398021) (← links)
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
- Efficient parallel algorithms for permutation graphs (Q1892868) (← links)
- Connected domination and dominating clique in trapezoid graphs (Q1962037) (← links)
- Acyclically pushable bipartite permutation digraphs: an algorithm (Q2497498) (← links)
- (Q4222504) (← links)
