An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6371109
@@ Property / zbMATH DE Number: 6371109 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph algorithms
@@ Property / zbMATH Keywords: graph algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithms
@@ Property / zbMATH Keywords: approximation algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+tree \(t\)-spanner problem
@@ Property / zbMATH Keywords: tree \(t\)-spanner problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimum max-stretch spanning tree problem
@@ Property / zbMATH Keywords: minimum max-stretch spanning tree problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+generalized chordal graphs
@@ Property / zbMATH Keywords: generalized chordal graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Robertson-Seymour's tree-decomposition
@@ Property / zbMATH Keywords: Robertson-Seymour's tree-decomposition / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+balanced separators
@@ Property / zbMATH Keywords: balanced separators / rank @@
+Normal rank

Revision as of 17:02, 30 June 2023