Using graphs for some discrete tomography problems (Q2581557): Difference between revisions

@@ Property / cites work @@
+Q5615282
@@ Property / cites work: Q5615282 / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+On the computational complexity of determining polyatomic structures by X-rays
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete tomography. Foundations, algorithms, and applications
+Normal rank
@@ Property / cites work @@
+Q3851094
@@ Property / cites work: Q3851094 / rank @@
+Normal rank
@@ Property / cites work @@
+Matchings in colored bipartite networks
@@ Property / cites work: Matchings in colored bipartite networks / rank @@
+Normal rank