Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs (Q2494815): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2005.11.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2081923266
@@ Property / OpenAlex ID: W2081923266 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4461916
@@ Property / cites work: Q4461916 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex heaviest paths and cycles in quasi-transitive digraphs
+Normal rank
@@ Property / cites work @@
+Steiner type problems for digraphs that are locally semicomplete or extended semicomplete
+Normal rank
@@ Property / cites work @@
+Quasi‐transitive digraphs
@@ Property / cites work: Quasi‐transitive digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3828034
@@ Property / cites work: Q3828034 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4325297
@@ Property / cites work: Q4325297 / rank @@
+Normal rank
@@ Property / cites work @@
+Orientations of digraphs almost preserving diameter
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms
@@ Property / cites work: Combinatorial optimization. Theory and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph
+Normal rank