Pages that link to "Item:Q3773922"

The following pages link to A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees (Q3773922):

Displaying 21 items.

• On the SPANNING \(k\)-TREE problem (Q686254) (← links)
• Locating facilities which interact: Some solvable cases (Q689235) (← links)
• Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
• The weighted perfect domination problem (Q912630) (← links)
• Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705) (← links)
• Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
• Dominating sets in perfect graphs (Q1174132) (← links)
• Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
• An optimal algorithm for finding dominating cycles in circular-arc graphs (Q1186160) (← links)
• The complexity of domination problems in circle graphs (Q1209148) (← links)
• The complexity of generalized clique covering (Q1262127) (← links)
• A recurrence template for several parameters in series-parallel graphs (Q1336624) (← links)
• Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
• Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
• Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs (Q3656858) (← links)
• Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595) (← links)
• SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS (Q4675877) (← links)
• Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
• Total domination in interval graphs (Q5903156) (← links)
• Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)