A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5443382): Difference between revisions

@@ Property / author @@
-Yoshiko Wakabayashi
@@ Property / author: Yoshiko Wakabayashi / rank @@
-Normal rank
@@ Property / author @@
+Yoshiko Wakabayashi
@@ Property / author: Yoshiko Wakabayashi / rank @@
+Normal rank
@@ 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-540-77918-6_15
+Normal rank
@@ Property / OpenAlex ID @@
+W1547284637
@@ Property / OpenAlex ID: W1547284637 / rank @@
+Normal rank
@@ Property / cites work @@
+A short note on the approximability of the maximum leaves spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees with many leaves in cubic graphs
@@ Property / cites work: Spanning trees with many leaves in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning Trees with Many Leaves
@@ Property / cites work: Spanning Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Leaf Spanning Trees in Almost Linear Time
+Normal rank
@@ Property / cites work @@
+Q4252040
@@ Property / cites work: Q4252040 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing full spanning trees for cubic graphs
@@ Property / cites work: Constructing full spanning trees for cubic graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5443382