Pages that link to "Item:Q4540045"

The following pages link to A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs (Q4540045):

Displaying 28 items.

• A note on connected dominating sets of distance-hereditary graphs (Q423975) (← links)
• Networks with small stretch number (Q876723) (← links)
• Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
• Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
• Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
• Homogeneously orderable graphs (Q1392023) (← links)
• MAD trees and distance-hereditary graphs (Q1408821) (← links)
• The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
• Simple linear-time algorithms for counting independent sets in distance-hereditary graphs (Q1706124) (← links)
• Distance-hereditary comparability graphs (Q1759843) (← links)
• A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
• Equistable distance-hereditary graphs (Q2473043) (← links)
• The Hamiltonian problem on distance-hereditary graphs (Q2489947) (← links)
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
• Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
• Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs (Q2719843) (← links)
• Linear Rank-Width of Distance-Hereditary Graphs (Q2945179) (← links)
• Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way (Q3010409) (← links)
• Fast and simple algorithms for counting dominating sets in distance-hereditary graphs (Q5012812) (← links)
• Dominating cliques in distance-hereditary graphs (Q5054776) (← links)
• (Q5136270) (← links)
• ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES (Q5249049) (← links)
• Graphs with bounded induced distance (Q5928866) (← links)
• Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)
• Domination in distance-hereditary graphs (Q5957300) (← links)
• The Weisfeiler-Leman dimension of distance-hereditary graphs (Q6166669) (← links)
• The parameterized complexity of terminal monitoring set (Q6575382) (← links)