Pages that link to "Item:Q652520"

The following pages link to The complexity of König subgraph problems and above-guarantee vertex cover (Q652520):

Displaying 20 items.

• König graphs for 3-paths and 3-cycles (Q266789) (← links)
• Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
• A characterization of König-Egerváry graphs with extendable vertex covers (Q783699) (← links)
• Finding small stabilizers for unstable graphs (Q896265) (← links)
• Note on maximal bisection above tight lower bound (Q1675768) (← links)
• Stabilizing network bargaining games by blocking players (Q1801001) (← links)
• Above guarantee parameterization for vertex cover on graphs with maximum degree 4 (Q2111076) (← links)
• Faster graph bipartization (Q2301359) (← links)
• Tractability of König edge deletion problems (Q2333799) (← links)
• On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
• Additive stabilizers for unstable graphs (Q2419360) (← links)
• Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
• A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
• Stabilizing Network Bargaining Games by Blocking Players (Q3186500) (← links)
• Research on solution space of bipartite graph vertex-cover by maximum matchings (Q3302166) (← links)
• Stabilizing Weighted Graphs (Q3387926) (← links)
• Graph Stabilization: A Survey (Q4689625) (← links)
• (Q5002762) (← links)
• New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
• Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)