Approximating minimum coloring and maximum independent set in dotted interval graphs (Q844151): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.11.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2006559329
@@ Property / OpenAlex ID: W2006559329 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921688
@@ Property / cites work: Q2921688 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Coloring Circular Arcs and Chords
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for interval graphs and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:844151