An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs (Q4780532): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207160211921
+Normal rank
@@ Property / OpenAlex ID @@
+W2103532004
@@ Property / OpenAlex ID: W2103532004 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Neighborhood Numbers
@@ Property / cites work: Algorithmic Aspects of Neighborhood Numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+<i>k</i>-Neighborhood-Covering and -Independence Problems for Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Neighborhood perfect graphs
@@ Property / cites work: Neighborhood perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+One-dimensional logic gate assignment and interval graphs
+Normal rank
@@ Property / cites work @@
+Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
+Normal rank
@@ Property / cites work @@
+THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS
+Normal rank