Pages that link to "Item:Q2568337"

The following pages link to Computing maximum stable sets for distance-hereditary graphs (Q2568337):

Displaying 8 items.

• Hamilton cycles in almost distance-hereditary graphs (Q317825) (← links)
• A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs (Q938338) (← links)
• A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
• Simple linear-time algorithms for counting independent sets in distance-hereditary graphs (Q1706124) (← links)
• The generalized independent set problem: polyhedral analysis and solution approaches (Q1753398) (← links)
• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
• Fast and simple algorithms for counting dominating sets in distance-hereditary graphs (Q5012812) (← links)
• (Q5090996) (← links)