Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? (Q4632186): 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.1007/978-3-319-39817-4_20
+Normal rank
@@ Property / OpenAlex ID @@
+W2486810668
@@ Property / OpenAlex ID: W2486810668 / rank @@
+Normal rank
@@ Property / cites work @@
+A further improved approximation algorithm for breakpoint graph decomposition
+Normal rank
@@ Property / cites work @@
+Q4234063
@@ Property / cites work: Q4234063 / rank @@
+Normal rank
@@ Property / cites work @@
+On the tightness of the alternating-cycle lower bound for sorting by reversals
+Normal rank
@@ Property / cites work @@
+Q4886096
@@ Property / cites work: Q4886096 / rank @@
+Normal rank
@@ Property / cites work @@
+The Approximability of the Exemplar Breakpoint Distance Problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4632186