Pages that link to "Item:Q1706124"
From MaRDI portal
The following pages link to Simple linear-time algorithms for counting independent sets in distance-hereditary graphs (Q1706124):
Displaying 3 items.
- Computing maximum stable sets for distance-hereditary graphs (Q2568337) (← links)
- Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks (Q2668378) (← links)
- Fast and simple algorithms for counting dominating sets in distance-hereditary graphs (Q5012812) (← links)