Benders decomposition with combinatorial feasibility cuts, multiple-cut addition, clique-cover heuristic, and initial cut generation solves k-defensive domination instances on Erdos-Renyi, chordal, and Barabasi-Albert graphs that remain unsolved by classical formulations.
science , volume=
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
A pipeline derives continuous signed edges from LLM stance scores on text and links discourse signals such as toxicity and extreme claims to changes in structural polarization measured by spectral and frustration scores on Reddit Brexit data.
A novel CVAE with mixture scheduling achieves fine-grained structural control in graph generation, showing high quality and controllability on five datasets.
citing papers explorer
-
A Benders Decomposition Approach for the k-Defensive Domination Problem
Benders decomposition with combinatorial feasibility cuts, multiple-cut addition, clique-cover heuristic, and initial cut generation solves k-defensive domination instances on Erdos-Renyi, chordal, and Barabasi-Albert graphs that remain unsolved by classical formulations.
-
Linking Extreme Discourse to Structural Polarization in Signed Interaction Networks
A pipeline derives continuous signed edges from LLM stance scores on text and links discourse signals such as toxicity and extreme claims to changes in structural polarization measured by spectral and frustration scores on Reddit Brexit data.
-
Fine-Grained Graph Generation through Latent Mixture Scheduling
A novel CVAE with mixture scheduling achieves fine-grained structural control in graph generation, showing high quality and controllability on five datasets.