Approximating the maximum internal spanning tree problem (Q1034535): Difference between revisions

@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 5626895
@@ Property / DOI @@
-.1016/j.tcs.2009.08.029
@@ Property / DOI: 10.1016/j.tcs.2009.08.029 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2009.08.029
+Normal rank
@@ Property / OpenAlex ID @@
+W1975444413
@@ Property / OpenAlex ID: W1975444413 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning Trees and Optimization Problems
@@ Property / cites work: Spanning Trees and Optimization Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On finding spanning trees with few leaves
@@ Property / cites work: On finding spanning trees with few leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763416
@@ Property / cites work: Q4763416 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763417
@@ Property / cites work: Q4763417 / 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 @@
+Q4737170
@@ Property / cites work: Q4737170 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+On a class of posets and the corresponding comparability graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2009.08.029
@@ Property / DOI: 10.1016/J.TCS.2009.08.029 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1034535