Pages that link to "Item:Q1068110"

The following pages link to Clustering and domination in perfect graphs (Q1068110):

Displaying 49 items.

• Small \(k\)-pyramids and the complexity of determining \(k\) (Q2253900) (← links)
• The complexity of the defensive domination problem in special graph classes (Q2279988) (← links)
• On the independent dominating set polytope (Q2368719) (← links)
• Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
• The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
• Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
• The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
• A ``maximum node clustering'' problem (Q2479564) (← links)
• A matrix characterization of interval and proper interval graphs (Q2483137) (← links)
• Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
• Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
• Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)
• Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
• Complexity and approximability of the happy set problem (Q2662689) (← links)
• Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
• Exact capacitated domination: on the computational complexity of uniqueness (Q2696625) (← links)
• Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
• Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
• Online Maximum k-Coverage (Q3088282) (← links)
• Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
• Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
• Connected Domination (Q3384607) (← links)
• Distance Domination in Graphs (Q3384610) (← links)
• An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
• Independent Domination in Triangle Graphs (Q3439603) (← links)
• A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650) (← links)
• (Q4488859) (← links)
• Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
• Convex Optimization for Group Feature Selection in Networked Data (Q5139860) (← links)
• On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm (Q5247696) (← links)
• (Q5708507) (← links)
• (Q5708621) (← links)
• On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
• Exploring the complexity boundary between coloring and list-coloring (Q5896984) (← links)
• Total domination in interval graphs (Q5903156) (← links)
• A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
• On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5918691) (← links)
• Parameterized algorithms for the happy set problem (Q5919103) (← links)
• On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5925555) (← links)
• Smallest independent dominating sets in Kronecker products of cycles (Q5951974) (← links)
• Intersection graphs of non-crossing paths (Q6041577) (← links)
• Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
• Edge deletion to tree-like graph classes (Q6124427) (← links)
• Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
• FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)
• Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (Q6500104) (← links)
• Stackelberg strategies on epidemic containment games (Q6535824) (← links)
• Open packing in \(H\)-free graphs and subclasses of split graphs (Q6547836) (← links)
• The sparse sequences of graphs (Q6640961) (← links)