Some Efficient Algorithms for Permutation Graphs
From MaRDI portal
Publication:4290917
DOI10.1006/jagm.1994.1021zbMath0804.68102MaRDI QIDQ4290917
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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
A polynomial-time algorithm for the paired-domination problem on permutation graphs, An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs, Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs, Connected domination and dominating clique in trapezoid graphs