On the feedback vertex set problem in permutation graphs
type: Item
instance of: scholarly article
title: On the feedback vertex set problem in permutation graphs
zbMATH Open document ID: 0822.68083
DOI: 10.1016/0020-0190(94)00133-2
author: Y. Daniel Liang
published in: Information Processing Letters
publication date: 1995-10-09T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 691032
zbMATH Keywords: permutation graph
zbMATH Keywords: dynamic programming scheme
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00133-2
OpenAlex ID: W2089749235
cites work: Connected domination and Steiner set on weighted permutation graphs
cites work: An efficient algorithm for maxdominance, with applications
cites work: Finding a minimum independent dominating set in a permutation graph
cites work: Q4281625
cites work: On domination problems for permutation and other graphs
cites work: Permutation graphs: Connected domination and Steiner trees
cites work: Dominating sets in perfect graphs
cites work: Domination in permutation graphs
cites work: Q3328583
cites work: A new approach for the domination problem on permutation graphs
cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs
cites work: An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph
cites work: On Comparability and Permutation Graphs
description: scientific article; zbMATH DE number 691032