Pages that link to "Item:Q1100915"
From MaRDI portal
The following pages link to On domination problems for permutation and other graphs (Q1100915):
Displayed 35 items.
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
- On the feedback vertex set problem for a planar graph (Q678111) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Complexity aspects of generalized Helly hypergraphs (Q845662) (← links)
- Feedback vertex set on AT-free graphs (Q944750) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs (Q1183585) (← links)
- The weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
- The complexity of domination problems in circle graphs (Q1209148) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- On the feedback vertex set problem in permutation graphs (Q1338778) (← links)
- \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
- A note on \(r\)-dominating cliques (Q1382816) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
- Coloring permutation graphs in parallel (Q1613373) (← links)
- Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
- Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803) (← links)
- On the domination number of permutation graphs and an application to strong fixed points (Q2208341) (← links)
- The \(k\)-power domination problem in weighted trees (Q2290632) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- Fast algorithms for the dominating set problem on permutation graphs (Q2366239) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Q2773025) (← links)
- Independent Domination in Triangle Graphs (Q3439603) (← links)
- Generate all maximal independent sets in permutation graphs (Q4323409) (← links)
- Dominating cliques in distance-hereditary graphs (Q5054776) (← links)
- r-Domination problems on homogeneously orderable graphs (Q5055891) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)