Recommendations
- Perfectness of clustered graphs
- scientific article; zbMATH DE number 1185594
- Dominating cliques in graphs
- Dominating cliques in graphs
- scientific article; zbMATH DE number 2114467
- scientific article; zbMATH DE number 10597
- Uniform clutters and dominating sets of graphs
- Partition-distance: A problem and class of perfect graphs arising in clustering
- Perfect \(k\)-domination in graphs
- Dominating cliques in chordal graphs
Cites work
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3896983 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 870426 (Why is no real title available?)
- A linear algorithm for the domination number of a tree
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Complement reducible graphs
- Dominating Sets in Chordal Graphs
- Domination in permutation graphs
- Efficient Optimization of Monotonic Functions on Trees
Cited in
(only showing first 100 items - show all)- A new upper bound for the 0-1 quadratic knapsack problem
- scientific article; zbMATH DE number 10597 (Why is no real title available?)
- Domination and total domination on asteroidal triple-free graphs
- An O(\(n\)) time algorithm for maximum matching on cographs
- On semi-\(P_ 4\)-sparse graphs
- Tight complexity bounds for FPT subgraph problems parameterized by clique-width
- Graph classes with structured neighborhoods and algorithmic applications
- Dominating cliques in graphs
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster
- On 3-coloring of \((2P_4,C_5)\)-free graphs
- On 3-coloring of \((2P_4,C_5)\)-free graphs
- A matrix characterization of interval and proper interval graphs
- An optimal algorithm for finding dominating cycles in circular-arc graphs
- The \textsc{max quasi-independent set} problem
- Mind the independence gap
- The densest \(k\)-subgraph problem on clique graphs
- Computing role assignments of split graphs
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Graph classes with structured neighborhoods and algorithmic applications
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Network flow interdiction on planar graphs
- Optimal clustering of multipartite graphs
- Parameterized algorithms for the happy set problem
- Well-covered graphs and extendability
- On cocolourings and cochromatic numbers of graphs
- Intersection graphs of non-crossing paths
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs
- The maximum vertex coverage problem on bipartite graphs
- A linear time algorithm for the maximum matching problem on cographs
- Dominating sets in perfect graphs
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
- Finding clubs in graph classes
- Online maximum \(k\)-coverage
- Approximation of the quadratic knapsack problem
- Distance domination in graphs
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
- Finding connected \(k\)-subgraphs with high density
- Variable neighborhood search for the heaviest \(k\)-subgraph
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs
- A branch-and-bound approach for maximum quasi-cliques
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
- Exploring the complexity boundary between coloring and list-coloring
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Finding minimum dominating cycles in permutation graphs
- The complexity of domination problems in circle graphs
- scientific article; zbMATH DE number 1471731 (Why is no real title available?)
- Permutation graphs: Connected domination and Steiner trees
- Smallest independent dominating sets in Kronecker products of cycles
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs
- PTAS for densest \(k\)-subgraph in interval graphs
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Total domination in interval graphs
- Cluster expansion formulas and perfect matchings
- On domination problems for permutation and other graphs
- Independent Domination in Triangle Graphs
- scientific article; zbMATH DE number 2230325 (Why is no real title available?)
- A polyhedral study of the maximum edge subgraph problem
- Independent dominating set problem revisited
- Partial and perfect path covers of cographs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
- The complexity of the defensive domination problem in special graph classes
- Well-partitioned chordal graphs
- Well-indumatched Trees and Graphs of Bounded Girth
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability
- On the independent dominating set polytope
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut
- Open packing in \(H\)-free graphs and subclasses of split graphs
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
- Treewidth versus clique number. II: Tree-independence number
- Quantum solutions for densest \(k\)-subgraph problems
- Complexity and approximability of the happy set problem
- Monopolar graphs: complexity of computing classical graph parameters
- Finding Connected Dense $$k$$-Subgraphs
- Small \(k\)-pyramids and the complexity of determining \(k\)
- On solving the densest \(k\)-subgraph problem on large graphs
- Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time
- Stackelberg strategies on epidemic containment games
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
- Algorithms for dominating clique problems
- Convex optimization for group feature selection in networked data
- FPT approximation and subexponential algorithms for covering few or many edges
- Computing densest \(k\)-subgraph with structural parameters
- A polynomial algorithm for the k-cluster problem on the interval graphs
- The sparse sequences of graphs
- Graph classes and approximability of the happy set problem
- Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games
- A ``maximum node clustering problem
- Connected domination
- Further results on the independent Roman domination number of graphs
- Exact algorithms for problems related to the densest \(k\)-set problem
- Short cycles dictate dichotomy status of the Steiner tree problem on bisplit graphs
- Paired-domination problem on distance-hereditary graphs
- An ellipsoidal bounding scheme for the quasi-clique number of a graph
This page was built for publication: Clustering and domination in perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1068110)
