An efficient algorithm to solve the distancek-domination problem on permutation graphs (Q5069774): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/09720529.2014.986906
+Normal rank
@@ Property / OpenAlex ID @@
+W2440158214
@@ Property / OpenAlex ID: W2440158214 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a minimum independent dominating set in a permutation graph
+Normal rank
@@ Property / cites work @@
+Q4247463
@@ Property / cites work: Q4247463 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5463350
@@ Property / cites work: Q5463350 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
+Normal rank
@@ Property / cites work @@
+Domination in permutation graphs
@@ Property / cites work: Domination in permutation graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On powers of \(m\)-trapezoid graphs
@@ Property / cites work: On powers of \(m\)-trapezoid graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to ``Topics on Domination''
@@ Property / cites work: Introduction to ``Topics on Domination'' / rank @@
+Normal rank
@@ Property / cites work @@
+Q4029974
@@ Property / cites work: Q4029974 / rank @@
+Normal rank
@@ Property / cites work @@
+The k-neighbor domination problem
@@ Property / cites work: The k-neighbor domination problem / rank @@
+Normal rank
@@ Property / cites work @@
+<i>k</i>-Neighborhood-Covering and -Independence Problems for Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Dominations in trapezoid graphs
@@ Property / cites work: Dominations in trapezoid graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Relations between packing and covering numbers of a tree
+Normal rank
@@ Property / cites work @@
+Q2793037
@@ Property / cites work: Q2793037 / rank @@
+Normal rank
@@ Property / cites work @@
+An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph
+Normal rank
@@ Property / cites work @@
+Fast algorithms for the dominating set problem on permutation graphs
+Normal rank

An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774): Difference between revisions

Latest revision as of 16:11, 28 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)