Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-57155-8_250
+Normal rank
@@ Property / OpenAlex ID @@
+W1717014977
@@ Property / OpenAlex ID: W1717014977 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear algorithm for optimal path cover problem on interval graphs
+Normal rank
@@ Property / cites work @@
+On the domatic number of interval graphs
@@ Property / cites work: On the domatic number of interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The edge Hamiltonian path problem is NP-complete
@@ Property / cites work: The edge Hamiltonian path problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian circuits in interval graph generalizations
+Normal rank
@@ Property / cites work @@
+Minimum node disjoint path covering for circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Towards a theory of domination in graphs
@@ Property / cites work: Towards a theory of domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Deferred-query: An efficient approach for some problems on interval graphs
+Normal rank
@@ Property / cites work @@
+Domination, independent domination, and duality in strongly chordal graphs
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Stability in circular arc graphs
@@ Property / cites work: Stability in circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms on circular-arc graphs
@@ Property / cites work: Linear time algorithms on circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: an ongoing guide
@@ Property / cites work: The NP-completeness column: an ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian circuits in interval graphs
@@ Property / cites work: Finding Hamiltonian circuits in interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Domatic Number Problem in Interval Graphs
@@ Property / cites work: The Domatic Number Problem in Interval Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
+Normal rank
@@ Property / cites work @@
+Q3898496
@@ Property / cites work: Q3898496 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear algorithm for domatic number problem on interval graphs
+Normal rank
@@ Property / cites work @@
+An Efficient Test for Circular-Arc Graphs
@@ Property / cites work: An Efficient Test for Circular-Arc Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Preserving order in a forest in less than logarithmic time and linear space
+Normal rank