Pages that link to "Item:Q2446306"

The following pages link to A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph (Q2446306):

Displaying 16 items.

• Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
• Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
• Labelling algorithms for paired-domination problems in block and interval graphs (Q987497) (← links)
• A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
• A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
• Domination in some subclasses of bipartite graphs (Q1630774) (← links)
• Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760) (← links)
• Convex and isometric domination of (weak) dominating pair graphs (Q1749540) (← links)
• A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260) (← links)
• Linear algorithms for red and blue domination in convex bipartite graphs (Q2115838) (← links)
• A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
• Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
• A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
• Injective coloring of some subclasses of bipartite graphs and chordal graphs (Q2659063) (← links)
• Paired Domination in Graphs (Q3384606) (← links)
• Approximation hardness of domination problems on generalized convex graphs (Q6664063) (← links)