On a simple randomized algorithm for finding a 2-factor in sparse graphs (Q1041775): 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.ipl.2005.04.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2089653160
@@ Property / OpenAlex ID: W2089653160 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast probabilistic algorithms for Hamiltonian circuits and matchings
+Normal rank
@@ Property / cites work @@
+Finding a Path of Superlogarithmic Length
@@ Property / cites work: Finding a Path of Superlogarithmic Length / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Finding hidden hamiltonian cycles
@@ Property / cites work: Finding hidden hamiltonian cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Stable networks and product graphs
@@ Property / cites work: Stable networks and product graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Longest Cycle Problem in Sparse Graphs
+Normal rank
@@ Property / cites work @@
+Q2921667
@@ Property / cites work: Q2921667 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths and cycles of superpolylogarithmic length
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q3684121
@@ Property / cites work: Q3684121 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4003764
@@ Property / cites work: Q4003764 / rank @@
+Normal rank
@@ Property / cites work @@
+On approximating the longest path in a graph
@@ Property / cites work: On approximating the longest path in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
+Normal rank