Pages that link to "Item:Q2636496"
From MaRDI portal
The following pages link to Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496):
Displaying 4 items.
- Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
- On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← links)
- A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
- Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (Q6089577) (← links)
