Some Efficient Algorithms for Permutation Graphs

doi:10.1006/jagm.1994.1021

Journal of Algorithms

Volume 16, Issue 3, May 1994, Pages 453-469

https://doi.org/10.1006/jagm.1994.1021 Get rights and content

Abstract

We present an O(n)-time algorithm for the minimum cardinality connected dominating set problem for permutation graphs (given their permutation functions). We also give O(n log n)-time algorithms for the minimum Steiner set and single-source shortest path problems for permutation graphs. Our results improve previously known O(n²)-time algorithms.

References (0)

Cited by (10)

A polynomial-time algorithm for the paired-domination problem on permutation graphs
2009, Discrete Applied Mathematics
A set $S$ of vertices in a graph $H = (V, E)$ with no isolated vertices is a paired-dominating set of $H$ if every vertex of $H$ is adjacent to at least one vertex in $S$ and if the subgraph induced by $S$ contains a perfect matching. Let $G$ be a permutation graph and $π$ be its corresponding permutation. In this paper we present an $O (m n)$ time algorithm for finding a minimum cardinality paired-dominating set for a permutation graph $G$ with $n$ vertices and $m$ edges.
Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
2004, Discrete Applied Mathematics
We investigate the complexity of several domination problems on the complements of bounded tolerance graphs and the complements of trapezoid graphs. We describe an $O (n^{2} log^{5} n)$ time and O(n²) space algorithm to solve the domination problem on the complement of a bounded tolerance graph, given a square embedding of that graph. We also prove that domination, connected domination and total domination are all NP-complete on co-trapezoid graphs.
An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
2000, Discrete Applied Mathematics
Connected domination and dominating clique in trapezoid graphs
2000, Discrete Applied Mathematics
The class of trapezoid graphs is a subclass of cocomparability graphs and contains both the interval graphs and the permutation graphs. In this paper we present an O(n) time algorithm for the minimum cardinality connected dominating set problem and an O(n+m) time algorithm for the minimum cardinality dominating clique problem in trapezoid graphs. Both algorithms require the trapezoid diagram to be given as input.
An optimal shortest path parallel algorithm for permutation graphs
1995, Journal of Parallel and Distributed Computing
Algorithms
2017, Domination in Graphs: Advanced Topics

View all citing articles on Scopus

View full text

Regular ArticleSome Efficient Algorithms for Permutation Graphs

Abstract

Regular Article
Some Efficient Algorithms for Permutation Graphs