Pages that link to "Item:Q1068110"
From MaRDI portal
The following pages link to Clustering and domination in perfect graphs (Q1068110):
Displaying 50 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
- Computing role assignments of split graphs (Q287443) (← links)
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- The \textsc{max quasi-independent set} problem (Q434194) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- Independent dominating set problem revisited (Q476836) (← links)
- An O(\(n\)) time algorithm for maximum matching on cographs (Q685476) (← links)
- A branch-and-bound approach for maximum quasi-cliques (Q744705) (← links)
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501) (← links)
- Mind the independence gap (Q776261) (← 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)
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
- Network flow interdiction on planar graphs (Q987697) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Finding minimum dominating cycles in permutation graphs (Q1060966) (← links)
- On domination problems for permutation and other graphs (Q1100915) (← 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)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
- Partial and perfect path covers of cographs (Q1281391) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- A linear time algorithm for the maximum matching problem on cographs (Q1314631) (← links)
- On cocolourings and cochromatic numbers of graphs (Q1315460) (← links)
- Well-covered graphs and extendability (Q1318795) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Secure total domination in graphs: bounds and complexity (Q1786876) (← links)
- A new upper bound for the 0-1 quadratic knapsack problem (Q1806683) (← links)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- Quantum solutions for densest \(k\)-subgraph problems (Q1983021) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Graph classes and approximability of the happy set problem (Q2019476) (← links)
- Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games (Q2019479) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← links)
