Pages that link to "Item:Q4632175"

The following pages link to A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175):

Displaying 3 items.

• An approximation algorithm for maximum internal spanning tree (Q1743498) (← links)
• Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
• Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671) (← links)