An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277): Difference between revisions

@@ 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.tcs.2011.06.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2008676475
@@ Property / OpenAlex ID: W2008676475 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear algorithm for optimal path cover problem on interval graphs
+Normal rank
@@ Property / cites work @@
+Q4875843
@@ Property / cites work: Q4875843 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4094891
@@ Property / cites work: Q4094891 / 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 @@
+Deferred-query—An efficient approach for problems on interval and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Deferred-query: An efficient approach for some problems on interval graphs
+Normal rank
@@ Property / cites work @@
+Solving the all-pair shortest path query problem on interval and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
+Normal rank
@@ Property / cites work @@
+The Hamiltonian circuit problem for circle graphs is NP-complete
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
+Normal rank
@@ Property / cites work @@
+Paths in interval graphs and circular arc graphs
@@ Property / cites work: Paths in interval graphs and circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
+Normal rank
@@ Property / cites work @@
+Q4256006
@@ Property / cites work: Q4256006 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140413
@@ Property / cites work: Q3140413 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+Q5503435
@@ Property / cites work: Q5503435 / rank @@
+Normal rank
@@ Property / cites work @@
+Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
+Normal rank
@@ Property / cites work @@
+Linear-time certifying algorithms for near-graphical sequences
+Normal rank
@@ Property / cites work @@
+The Hamiltonian problem on distance-hereditary graphs
+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 @@
+$O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
+Normal rank
@@ Property / cites work @@
+Hamilton cycles in split graphs with large minimum degree
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
+Normal rank
@@ Property / cites work @@
+Solving the path cover problem on circular-arc graphs by using an approximation algorithm
+Normal rank
@@ Property / cites work @@
+Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
+Normal rank
@@ Property / cites work @@
+Hamilton Paths in Grid Graphs
@@ Property / cites work: Hamilton Paths in Grid 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 @@
+Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Q4471290
@@ Property / cites work: Q4471290 / rank @@
+Normal rank
@@ Property / cites work @@
+Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
+Normal rank
@@ Property / cites work @@
+Q3998976
@@ Property / cites work: Q3998976 / 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 @@
+Linear-time recognition of circular-arc graphs
@@ Property / cites work: Linear-time recognition of circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Certifying algorithms
@@ Property / cites work: Certifying algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4862336
@@ Property / cites work: Q4862336 / rank @@
+Normal rank
@@ Property / cites work @@
+An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
+Normal rank
@@ Property / cites work @@
+Q3685231
@@ Property / cites work: Q3685231 / rank @@
+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 @@
+Interval graphs and maps of DNA
@@ Property / cites work: Interval graphs and maps of DNA / rank @@
+Normal rank