The critical node detection problem in networks: A survey
M Lalou, MA Tahraoui, H Kheddouci - Computer Science Review, 2018 - Elsevier
In networks, not all nodes have the same importance, and some are more important than
others. The issue of finding the most important nodes in networks has been addressed …
others. The issue of finding the most important nodes in networks has been addressed …
Thinking like a vertex: A survey of vertex-centric frameworks for large-scale distributed graph processing
The vertex-centric programming model is an established computational paradigm recently
incorporated into distributed processing frameworks to address challenges in large-scale …
incorporated into distributed processing frameworks to address challenges in large-scale …
Social balance in signed networks
The theory of social balance, also called structural balance, is first proposed by Heider in
1940s, which is utilized to describe the potential social dynamics process. This theory is of …
1940s, which is utilized to describe the potential social dynamics process. This theory is of …
SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices
M Kim, KS Candan - Data & Knowledge Engineering, 2012 - Elsevier
Graphs are used for modeling a large spectrum of data from the web, to social connections
between individuals, to concept maps and ontologies. As the number and complexities of …
between individuals, to concept maps and ontologies. As the number and complexities of …
Investigating the opinions distribution in the controversy on social media
The research works that investigate controversies on social media seek to answer questions
such as the following: Is the topic controversial? What opinions do the users hold? What is …
such as the following: Is the topic controversial? What opinions do the users hold? What is …
A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
The minimum cut problem, MC, and the special case of the vertex separator problem,
consists in partitioning the set of nodes of a graph G into k subsets of given sizes in order to …
consists in partitioning the set of nodes of a graph G into k subsets of given sizes in order to …
[HTML][HTML] A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
Abstract The Vertex Separator Problem (VSP) is an NP-hard problem which emerges from a
variety of important domains and applications. In this paper, we present an improved …
variety of important domains and applications. In this paper, we present an improved …
[PDF][PDF] Breakout local search for the vertex separator problem
In this paper, we propose the first heuristic approach for the vertex separator problem (VSP),
based on Breakout Local Search (BLS). BLS is a recent meta-heuristic that follows the …
based on Breakout Local Search (BLS). BLS is a recent meta-heuristic that follows the …
An efficient iterative approach to explainable feature learning
This article introduces a new iterative approach to explainable feature learning. During each
iteration, new features are generated, first by applying arithmetic operations on the input set …
iteration, new features are generated, first by applying arithmetic operations on the input set …
Continuous quadratic programming formulations of optimization problems on graphs
WW Hager, JT Hungerford - European Journal of Operational Research, 2015 - Elsevier
Four NP-hard optimization problems on graphs are studied: The vertex separator problem,
the edge separator problem, the maximum clique problem, and the maximum independent …
the edge separator problem, the maximum clique problem, and the maximum independent …