The following pages link to Domination in permutation graphs (Q3731637):
Displaying 50 items.
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- A decidability result for the dominating set problem (Q410736) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- Independence and domination in polygon graphs (Q686246) (← links)
- Computing residual connectedness reliability for restricted networks (Q686266) (← links)
- A new approach for the domination problem on permutation graphs (Q750166) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Independent domination in hereditary classes (Q818132) (← links)
- Finding a maximum independent set in a permutation graph (Q916397) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- Finding minimum dominating cycles in permutation graphs (Q1060966) (← links)
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
- Clustering and domination in perfect graphs (Q1068110) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628) (← links)
- On domination problems for permutation and other graphs (Q1100915) (← links)
- An efficient algorithm for maxdominance, with applications (Q1115629) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
- Finding a minimum independent dominating set in a permutation graph (Q1117255) (← links)
- Total domination in block graphs (Q1124531) (← 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 weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
- Incorporating negative-weight vertices in certain vertex-search graph algorithms (Q1198080) (← 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)
- Parallel algorithms for permutation graphs (Q1314630) (← links)
- Well-covered graphs and extendability (Q1318795) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- On the feedback vertex set problem in permutation graphs (Q1338778) (← links)
- One-node cutsets and the dominating set polytope (Q1356733) (← links)
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
- Coloring permutation graphs in parallel (Q1613373) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- Induced star partition of graphs (Q2161236) (← links)
- On the broadcast domination number of permutation graphs (Q2285130) (← links)
- Fast algorithms for the dominating set problem on permutation graphs (Q2366239) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- On the dominating set polytope (Q2426444) (← links)
- Polar SAT and related graphs (Q2466002) (← links)
- On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem (Q2773025) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
- (Q3715153) (← links)
- Generate all maximal independent sets in permutation graphs (Q4323409) (← links)
- An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774) (← links)
