Spanning trees with few branch vertices in graphs of bounded neighborhood diversity (Q6148080): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-031-32733-9_22
+Normal rank
@@ Property / OpenAlex ID @@
+W4377971972
@@ Property / OpenAlex ID: W4377971972 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of happy coloring problems
+Normal rank
@@ Property / cites work @@
+Q4560236
@@ Property / cites work: Q4560236 / rank @@
+Normal rank
@@ Property / cites work @@
+Gathering with Minimum Delay in Tree Sensor Networks
+Normal rank
@@ Property / cites work @@
+Optimal time data gathering in wireless networks with multidirectional antennas
+Normal rank
@@ Property / cites work @@
+On structural parameterizations of star coloring
@@ Property / cites work: On structural parameterizations of star coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Lower and upper bounds for the spanning tree with minimum branch vertices
+Normal rank
@@ Property / cites work @@
+Relations, models and a memetic approach for three degree-dependent spanning tree problems
+Normal rank
@@ Property / cites work @@
+Bounded-degree spanning tree problems: models and new algorithms
+Normal rank
@@ Property / cites work @@
+Approximating spanning trees with few branches
@@ Property / cites work: Approximating spanning trees with few branches / rank @@
+Normal rank
@@ Property / cites work @@
+Evangelism in social networks: Algorithms and complexity
+Normal rank
@@ Property / cites work @@
+Iterated Type Partitions
@@ Property / cites work: Iterated Type Partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of immunization in the threshold model
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4633895
@@ Property / cites work: Q4633895 / rank @@
+Normal rank
@@ Property / cites work @@
+Intractability of Clique-Width Parameterizations
@@ Property / cites work: Intractability of Clique-Width Parameterizations / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Modular-Width
@@ Property / cites work: Parameterized Algorithms for Modular-Width / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning spiders and light-splitting switches
@@ Property / cites work: Spanning spiders and light-splitting switches / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737170
@@ Property / cites work: Q4737170 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of conflict-free colorings of graphs
@@ Property / cites work: Complexity of conflict-free colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Collision-free path coloring with application to minimum-delay gathering in sensor networks
+Normal rank
@@ Property / cites work @@
+Integer programming in parameterized complexity: five miniatures
+Normal rank
@@ Property / cites work @@
+Algorithmic meta-theorems for restrictions of treewidth
+Normal rank
@@ Property / cites work @@
+Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
+Normal rank
@@ Property / cites work @@
+Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
+Normal rank
@@ Property / cites work @@
+An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
+Normal rank
@@ Property / cites work @@
+Spanning trees with a bounded number of branch vertices in a claw-free graph
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Cutting-plane-based algorithms for two branch vertices related spanning tree problems
+Normal rank
@@ Property / cites work @@
+An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
+Normal rank
@@ Property / cites work @@
+Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
+Normal rank