Some Efficient Algorithms for Permutation Graphs
From MaRDI portal
Publication:4290917
DOI10.1006/JAGM.1994.1021zbMATH Open0804.68102OpenAlexW2012809896MaRDI QIDQ4290917FDOQ4290917
Authors: Oscar H. Ibarra, Qi Zheng 
Publication date: 5 May 1994
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1994.1021
Recommendations
- Efficient parallel algorithms for permutation graphs
- Parallel algorithms for permutation graphs
- scientific article; zbMATH DE number 1230492
- scientific article; zbMATH DE number 108587
- Efficient parallel algorithms for bipartite permutation graphs
- scientific article; zbMATH DE number 512913
- On permutation graphs
- Fast algorithms for the dominating set problem on permutation graphs
- scientific article; zbMATH DE number 4049081
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (17)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs
- An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs
- A linear time algorithm for finding all hinge vertices of a permutation graph
- Connected domination and Steiner set on weighted permutation graphs
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
- Efficient neighborhood encoding for interval graphs and permutation graphs and \(O(n)\) breadth-first search
- Acyclically pushable bipartite permutation digraphs: an algorithm
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
- Efficient parallel algorithms for permutation graphs
- Connected domination and dominating clique in trapezoid graphs
- Title not available (Why is that?)
- Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem
This page was built for publication: Some Efficient Algorithms for Permutation Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290917)
