Pages that link to "Item:Q1743498"
From MaRDI portal
The following pages link to An approximation algorithm for maximum internal spanning tree (Q1743498):
Displaying 7 items.
- 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)
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q2232252) (← links)
- (Q2980926) (redirect page) (← links)
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q5049994) (← links)
- Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671) (← links)
