Pages that link to "Item:Q1174135"

The following pages link to Permutation graphs: Connected domination and Steiner trees (Q1174135):

Displaying 31 items.

• Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
• Computing residual connectedness reliability for restricted networks (Q686266) (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
• On the terminal connection problem (Q831820) (← links)
• Finding minimum dominating cycles in permutation graphs (Q1060966) (← links)
• On domination problems for permutation and other graphs (Q1100915) (← links)
• Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
• Dominating sets in perfect graphs (Q1174132) (← links)
• Problems with generalized Steiner problems (Q1186806) (← links)
• Connected domination and Steiner set on weighted permutation graphs (Q1190520) (← links)
• The complexity of domination problems in circle graphs (Q1209148) (← links)
• Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
• On the feedback vertex set problem in permutation graphs (Q1338778) (← links)
• \(H\)-domination in graphs (Q1415548) (← links)
• An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
• Making a dominating set of a graph connected (Q1656909) (← links)
• The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
• Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
• Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
• On dominating set of some subclasses of string graphs (Q2144448) (← links)
• Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy (Q2165280) (← links)
• The balanced connected subgraph problem for geometric intersection graphs (Q2166729) (← links)
• A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
• A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
• Traceability of connected domination critical graphs (Q2656675) (← links)
• CONNECTED LIAR'S DOMINATION IN GRAPHS: COMPLEXITY AND ALGORITHMS (Q2874035) (← links)
• On the Structure of Graphs Vertex Critical with Respect to Connected Domination (Q2971614) (← links)
• Connected Domination (Q3384607) (← links)
• Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (Q4454318) (← links)
• 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
• On the computational difficulty of the terminal connection problem (Q6041044) (← links)