Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow (Q4796447): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q2718910
@@ Property / cites work: Q2718910 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal covering of cacti by vertex-disjoint paths
+Normal rank
@@ Property / cites work @@
+Advances on the Hamiltonian Completion Problem
@@ Property / cites work: Advances on the Hamiltonian Completion Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Algorithm for Finding Maximal Network Flows and an                         Application to the Hitchcock Problem
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
+Normal rank
@@ Property / cites work @@
+On mapping processes to processors in distributed systems
+Normal rank
@@ Property / cites work @@
+A linear algorithm for the Hamiltonian completion number of a tree
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1017/s1446181100013894
+Normal rank
@@ Property / OpenAlex ID @@
+W2169473633
@@ Property / OpenAlex ID: W2169473633 / rank @@
+Normal rank