Pages that link to "Item:Q2380066"
From MaRDI portal
The following pages link to On finding spanning trees with few leaves (Q2380066):
Displaying 36 items.
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- Approximating the maximum internal spanning tree problem (Q1034535) (← links)
- On finding most uniform spanning trees (Q1102979) (← links)
- Using local adaptations to reconfigure a spanning tree of a network (Q1345965) (← links)
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems (Q1694405) (← links)
- An approximation algorithm for maximum internal spanning tree (Q1743498) (← links)
- Depth first search in claw-free graphs (Q1744633) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
- Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
- A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
- On minimum leaf spanning trees and a criticality notion (Q2182204) (← links)
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q2232252) (← links)
- Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← links)
- On the minimum leaf number of cubic graphs (Q2324488) (← links)
- Approximating spanning trees with few branches (Q2344216) (← links)
- Better approximation algorithms for the maximum internal spanning tree problem (Q2350897) (← links)
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems (Q2357824) (← links)
- On spanning cycles, paths and trees (Q2446869) (← links)
- Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496) (← links)
- A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem (Q2656175) (← links)
- Unrooted non-binary tree-based phylogenetic networks (Q2656952) (← links)
- Conditions for spanning trees whose internal subtrees have few branch vertices and leaves (Q2693743) (← links)
- A survey on algorithms for the maximum internal spanning tree and related problems (Q2861557) (← links)
- Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem (Q3183476) (← links)
- A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
- On the number of leaves of a euclidean minimal spanning tree (Q3780174) (← links)
- A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175) (← links)
- Spanning k-ended trees of 3-regular connected graphs (Q5006619) (← links)
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q5049994) (← links)
- (Q5244007) (← links)
- Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671) (← links)
- How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks (Q6162049) (← links)
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth (Q6201339) (← links)
