The eternal dominating set problem for proper interval graphs (Q2345856): Difference between revisions

@@ Property / author @@
-Cid Carvalho De Souza
@@ Property / author: Cid Carvalho De Souza / rank @@
-Normal rank
@@ Property / author @@
+Cid Carvalho De Souza
@@ Property / author: Cid Carvalho De Souza / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2015.02.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2027125546
@@ Property / OpenAlex ID: W2027125546 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4820838
@@ Property / cites work: Q4820838 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for proper interval graph recognition
+Normal rank
@@ Property / cites work @@
+Q4681994
@@ Property / cites work: Q4681994 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3635564
@@ Property / cites work: Q3635564 / rank @@
+Normal rank
@@ Property / cites work @@
+Protecting a graph with mobile guards
@@ Property / cites work: Protecting a graph with mobile guards / rank @@
+Normal rank