The following pages link to Sparse reliable graph backbones (Q418121):
Displaying 3 items.
- On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← links)
- Computing exact minimum cuts without knowing the graph (Q4993305) (← links)
- Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (Q6089577) (← links)