Fast algorithms for the dominating set problem on permutation graphs
From MaRDI portal
Publication:2366239
DOI10.1007/BF01190158zbMath0768.68063MaRDI QIDQ2366239
Publication date: 29 June 1993
Published in: Algorithmica (Search for Journal in Brave)
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68R10: Graph theory (including graph drawing) in computer science
90C39: Dynamic programming
Related Items
Graph classes with structured neighborhoods and algorithmic applications, 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, Graph Classes with Structured Neighborhoods and Algorithmic Applications
Cites Work