Skip to Content
You are currently on the new version of our website. Access the old version .

157 Results Found

  • Article
  • Open Access
9 Citations
5,494 Views
30 Pages

12 October 2020

The Reeb graph of a scalar function that is defined on a domain gives a topologically meaningful summary of that domain. Reeb graphs have been shown in the past decade to be of great importance in geometric processing, image processing, computer grap...

(This article belongs to the Special Issue Topological Data Analysis)
  • Article
  • Open Access
3 Citations
4,762 Views
15 Pages

Performance Evaluation of Parallel Graphs Algorithms Utilizing Graphcore IPU

  • Paweł Gepner,
  • Bartłomiej Kocot,
  • Marcin Paprzycki,
  • Maria Ganzha and ,
  • Leonid Moroz and
  • Tomasz Olas
  • + 1 author+ 0 author

Recent years have been characterized by increasing interest in graph computations. This trend can be related to the large number of potential application areas. Moreover, increasing computational capabilities of modern computers allowed turning theor...

(This article belongs to the Special Issue Recent Advances of Cloud, Edge, and Parallel Computing)
  • Article
  • Open Access
5 Citations
4,779 Views
26 Pages

Many modern applications are modeled using graphs of some kind. Given a graph, reachability, that is, discovering whether there is a path between two given nodes, is a fundamental problem as well as one of the most important steps of many other algor...

  • Article
  • Open Access
1,447 Views
28 Pages

Cover Edge-Based Novel Triangle Counting

  • David A. Bader,
  • Fuhuan Li,
  • Zhihui Du,
  • Palina Pauliuchenka and ,
  • Oliver Alvarado Rodriguez,
  • Anant Gupta,
  • Sai Sri Vastav Minnal,
  • Valmik Nahata,
  • Anya Ganeshan and
  • Jason Lew
  • + 6 authors+ 1 author

28 October 2025

Counting and listing triangles in graphs is a fundamental task in network analysis, supporting applications such as community detection, clustering coefficient computation, k-truss decomposition, and triangle centrality. We introduce the cover-edge s...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
9 Citations
4,731 Views
25 Pages

The Maximum Common Subgraph problem has been long proven NP-hard. Nevertheless, it has countless practical applications, and researchers are still searching for exact solutions and scalable heuristic approaches. Driven by applications in molecular sc...

(This article belongs to the Special Issue Graph Theory and Its Applications in Computing)
  • Article
  • Open Access
3 Citations
3,941 Views
17 Pages

FSM-BC-BSP: Frequent Subgraph Mining Algorithm Based on BC-BSP

  • Fangling Leng,
  • Fan Li,
  • Yubin Bao,
  • Tiancheng Zhang and
  • Ge Yu

9 April 2024

As graph models become increasingly prevalent in the processing of scientific data, the exploration of effective methods for the mining of meaningful patterns from large-scale graphs has garnered significant research attention. This paper delves into...

(This article belongs to the Special Issue Deep Learning for Graph Management and Analytics)
  • Article
  • Open Access
9 Citations
4,829 Views
21 Pages

22 September 2020

The problem of scheduling parallel tasks graphs (PTGs) represented by directed acyclic graphs (DAGs) in heterogeneous distributed computing systems (HDCSs) is considered an nondeterministic polynomial time (NP) problem due to the diversity of charact...

(This article belongs to the Special Issue Interdisciplinary Artificial Intelligence: Methods and Applications of Nature-Inspired Computing)
  • Article
  • Open Access
11 Citations
4,626 Views
33 Pages

Remote Sensing Scene Graph and Knowledge Graph Matching with Parallel Walking Algorithm

  • Wei Cui,
  • Yuanjie Hao,
  • Xing Xu,
  • Zhanyun Feng and ,
  • Huilin Zhao,
  • Cong Xia and
  • Jin Wang
  • + 2 authors+ 0 author

29 September 2022

In deep neural network model training and prediction, due to the limitation of GPU memory and computing resources, massive image data must be cropped into limited-sized samples. Moreover, in order to improve the generalization ability of the model, t...

  • Article
  • Open Access
4 Citations
3,116 Views
18 Pages

23 April 2020

This article investigates the efficiency of a doParallel algorithm and a formal concept analysis (FCA) network graph applied to recommendation systems. It is the first article using the FCA method to create a network graph and apply this graph to imp...

  • Article
  • Open Access
3 Citations
2,645 Views
18 Pages

28 July 2023

This study addresses the importance of focal nodes in understanding the structural composition of networks. To identify these crucial nodes, a novel technique based on parallel Fuzzy Cognitive Maps (FCMs) is proposed. By utilising the focal nodes pro...

(This article belongs to the Special Issue Advances in Natural Computing: Methods and Application)
  • Article
  • Open Access
5 Citations
5,096 Views
23 Pages

Distributed Graph Diameter Approximation

  • Matteo Ceccarello,
  • Andrea Pietracaprina,
  • Geppino Pucci and
  • Eli Upfal

1 September 2020

We present an algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. In order to be efficient in terms of both time and space, our algorithm is based on a decom...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Feature Paper
  • Article
  • Open Access
6 Citations
3,397 Views
16 Pages

3 September 2021

Lattice converters combine the merits of both cascaded-bridge converters and multi-paralleled converters, leading to infinitely large current and voltage capabilities with modularity and scalability as well as small passive components. However, latti...

(This article belongs to the Special Issue Power Quality Conditioning and Stability Enhancement of More-Electronics Power Systems)
  • Article
  • Open Access
3 Citations
3,140 Views
16 Pages

Graph Algorithms for Mixture Interpretation

  • Benjamin Crysup,
  • August E. Woerner,
  • Jonathan L. King and
  • Bruce Budowle

27 January 2021

The scale of genetic methods are presently being expanded: forensic genetic assays previously were limited to tens of loci, but now technologies allow for a transition to forensic genomic approaches that assess thousands to millions of loci. However,...

(This article belongs to the Special Issue Forensic Mitochondrial Genomics)
  • Article
  • Open Access
1 Citations
1,992 Views
53 Pages

Pareto Approximation Empirical Results of Energy-Aware Optimization for Precedence-Constrained Task Scheduling Considering Switching Off Completely Idle Machines

  • José Antonio Castán Rocha,
  • Alejandro Santiago,
  • Alejandro H. García-Ruiz,
  • Jesús David Terán-Villanueva and ,
  • Salvador Ibarra Martínez and
  • Mayra Guadalupe Treviño Berrones
  • + 1 author+ 0 author

27 November 2024

Recent advances in cloud computing, large language models, and deep learning have started a race to create massive High-Performance Computing (HPC) centers worldwide. These centers increase in energy consumption proportionally to their computing capa...

(This article belongs to the Special Issue Recent Advances in Optimization Algorithms for Scheduling and Operations Research)
  • Article
  • Open Access
4 Citations
2,836 Views
15 Pages

7 April 2024

The canonical decomposition of a bipartite graph is a new decomposition method that involves three operators: parallel, series, and K⨁ S. The class of weak-bisplit graphs is the class of totally decomposable graphs with respect to these o...

(This article belongs to the Special Issue Symmetry in Graph Algorithms and Graph Theory III)
  • Article
  • Open Access
8 Citations
7,242 Views
14 Pages

10 October 2017

A graph is a very important structure to describe many applications in the real world. In many applications, such as dependency graphs and debt graphs, it is an important problem to find and remove cycles to make these graphs be cycle-free. The commo...

  • Article
  • Open Access
1,691 Views
20 Pages

23 July 2025

Many challenges in solving large graph coloring through parallel strategies remain unresolved. Previous algorithms based on Pregel-like frameworks, such as Apache Giraph, encounter parallelism bottlenecks due to sequential execution and the need for...

(This article belongs to the Special Issue Symmetry in Solving NP-Hard Problems)
  • Article
  • Open Access
1 Citations
2,443 Views
12 Pages

31 August 2024

In recent years, various graph computing architectures have been proposed to process graph data that represent complex dependencies between different objects in the world. The designs of the processing element (PE) in traditional graph computing acce...

  • Article
  • Open Access
36 Citations
8,549 Views
18 Pages

A Parallel Approach for Frequent Subgraph Mining in a Single Large Graph Using Spark

  • Fengcai Qiao,
  • Xin Zhang,
  • Pei Li,
  • Zhaoyun Ding and ,
  • Shanshan Jia and
  • Hui Wang
  • + 1 author+ 0 author

2 February 2018

Frequent subgraph mining (FSM) plays an important role in graph mining, attracting a great deal of attention in many areas, such as bioinformatics, web data mining and social networks. In this paper, we propose SSiGraM (Spark based Single Graph Minin...

(This article belongs to the Special Issue Socio-Cognitive and Affective Computing)
  • Article
  • Open Access
8 Citations
3,811 Views
16 Pages

With the wide application of computational fluid dynamics in various fields and the continuous growth of the complexity of the problem and the scale of the computational grid, large-scale parallel computing came into being and became an indispensable...

(This article belongs to the Special Issue Bio-Inspired Design and Optimisation of Engineering Systems)
  • Article
  • Open Access
14 Citations
3,774 Views
20 Pages

High Area-Efficient Parallel Encoder with Compatible Architecture for 5G LDPC Codes

  • Yufei Zhu,
  • Zuocheng Xing,
  • Zerun Li,
  • Yang Zhang and
  • Yifan Hu

16 April 2021

This paper presents a novel parallel quasi-cyclic low-density parity-check (QC-LDPC) encoding algorithm with low complexity, which is compatible with the 5th generation (5G) new radio (NR). Basing on the algorithm, we propose a high area-efficient pa...

(This article belongs to the Special Issue Information Technologies and Electronics Ⅱ)
  • Article
  • Open Access
2 Citations
3,156 Views
17 Pages

7 April 2023

Graph summarization techniques are vital in simplifying and extracting enormous quantities of graph data. Traditional static graph structure-based summarization algorithms generally follow a minimum description length (MDL) style, and concentrate on...

  • Article
  • Open Access
1 Citations
2,595 Views
23 Pages

G-Pre: A Graph-Theory-Based Matrix Preconditioning Algorithm for Finite Element Simulation Solutions

  • Min Chen,
  • Jingyan Li,
  • Lijie Li,
  • Kang Liang and ,
  • Gai Wu and
  • Wei Shen
  • + 1 author+ 0 author

5 May 2025

In finite element simulation and analysis, increasing simulation scales place high demands on the preconditioning and solution process of linear matrices. However, the most commonly used preconditioning methods for incomplete LU factorization usually...

  • Article
  • Open Access
10 Citations
8,057 Views
11 Pages

8 June 2016

In the pursuit of finding subclasses of the makespan minimization problem on unrelated parallel machines that have approximation algorithms with approximation ratio better than 2, the graph balancing problem has been of current interest. In the graph...

  • Feature Paper
  • Article
  • Open Access
25 Citations
7,274 Views
17 Pages

26 April 2019

Recommender systems are one of the fields of information filtering systems that have attracted great research interest during the past several decades and have been utilized in a large variety of applications, from commercial e-shops to social networ...

(This article belongs to the Special Issue Modern Recommender Systems: Approaches, Challenges and Applications)
  • Article
  • Open Access
4 Citations
4,052 Views
16 Pages

1 July 2018

To efficiently process time-evolving graphs where new vertices and edges are inserted over time, an incremental computing model, which processes the newly-constructed graph based on the results of the computation on the outdated graph, is widely adop...

(This article belongs to the Special Issue Emerging Approaches and Advances in Big Data)
  • Article
  • Open Access
20 Citations
6,157 Views
15 Pages

26 December 2022

Planning tasks are important in construction, manufacturing, logistics, and education. At the same time, scheduling problems belong to the class of NP-hard optimization problems. Ant colony algorithm optimization is one of the most common swarm intel...

(This article belongs to the Special Issue Bio-Inspired Algorithms)
  • Article
  • Open Access
2 Citations
3,413 Views
18 Pages

Parallel Learning of Dynamics in Complex Systems

  • Xueqin Huang,
  • Xianqiang Zhu,
  • Xiang Xu,
  • Qianzhen Zhang and
  • Ailin Liang

15 December 2022

Dynamics always exist in complex systems. Graphs (complex networks) are a mathematical form for describing a complex system abstractly. Dynamics can be learned efficiently from the structure and dynamics state of a graph. Learning the dynamics in gra...

(This article belongs to the Special Issue Data Driven Decision-Making for Complex Production Systems)
  • Article
  • Open Access
3 Citations
3,498 Views
16 Pages

The study of the multi-agent task allocation problem with multiple depots is crucial for investigating multi-agent collaboration. Although many traditional heuristic algorithms can be adopted to handle the concerned task allocation problem, they are...

(This article belongs to the Collection Advance Technologies of Navigation for Intelligent Vehicles)
  • Article
  • Open Access
3,747 Views
27 Pages

Finding Bottlenecks in Message Passing Interface Programs by Scalable Critical Path Analysis

  • Vladimir Korkhov,
  • Ivan Gankevich,
  • Anton Gavrikov,
  • Maria Mingazova and ,
  • Ivan Petriakov,
  • Dmitrii Tereshchenko,
  • Artem Shatalin and
  • Vitaly Slobodskoy
  • + 3 authors+ 0 author

31 October 2023

Bottlenecks and imbalance in parallel programs can significantly affect performance of parallel execution. Finding these bottlenecks is a key issue in performance analysis of MPI programs especially on a large scale. One of the ways to discover bottl...

(This article belongs to the Collection Parallel and Distributed Computing: Algorithms and Applications)
  • Article
  • Open Access
14 Citations
5,622 Views
29 Pages

A Multi-Start Algorithm for Solving the Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints

  • Leandro Pinto Fava,
  • João Carlos Furtado,
  • Gilson Augusto Helfer,
  • Jorge Luis Victória Barbosa and ,
  • Marko Beko,
  • Sérgio Duarte Correia and
  • Valderi Reis Quietinho Leithardt
  • + 2 authors+ 0 author

14 September 2021

This work presents a multistart algorithm for solving the capacitated vehicle routing problem with 2D loading constraints (2L-CVRP) allowing for the rotation of goods. Research dedicated to graph theory and symmetry considered the vehicle routing pro...

  • Feature Paper
  • Article
  • Open Access
1 Citations
2,724 Views
20 Pages

15 September 2025

We propose a dynamic extension of the Petford–Welsh coloring algorithm that estimates the chromatic number of a graph without requiring k as an input. The basic algorithm is based on the model that is closely related to the Boltzmann machines t...

  • Article
  • Open Access
10 Citations
4,982 Views
16 Pages

Calculating the Moore–Penrose Generalized Inverse on Massively Parallel Systems

  • Vukašin Stanojević,
  • Lev Kazakovtsev,
  • Predrag S. Stanimirović,
  • Natalya Rezova and
  • Guzel Shkaberina

27 September 2022

In this work, we consider the problem of calculating the generalized Moore–Penrose inverse, which is essential in many applications of graph theory. We propose an algorithm for the massively parallel systems based on the recursive algorithm for...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
11 Citations
6,516 Views
28 Pages

Fast and Effective Retrieval for Large Multimedia Collections

  • Stefan Wagenpfeil,
  • Binh Vu,
  • Paul Mc Kevitt and
  • Matthias Hemmje

The indexing and retrieval of multimedia content is generally implemented by employing feature graphs. These graphs typically contain a significant number of nodes and edges to reflect the level of detail in feature detection. A higher level of detai...

(This article belongs to the Special Issue Multimedia Systems for Multimedia Big Data)
  • Article
  • Open Access
2 Citations
3,538 Views
22 Pages

Parallelization Strategies for Graph-Code-Based Similarity Search

  • Patrick Steinert,
  • Stefan Wagenpfeil,
  • Paul Mc Kevitt,
  • Ingo Frommholz and
  • Matthias Hemmje

The volume of multimedia assets in collections is growing exponentially, and the retrieval of information is becoming more complex. The indexing and retrieval of multimedia content is generally implemented by employing feature graphs. Feature graphs...

(This article belongs to the Special Issue Multimedia Systems for Multimedia Big Data)
  • Article
  • Open Access
1 Citations
1,565 Views
16 Pages

13 September 2024

We consider the problem of finding the largest clique of a graph. This is an NP-hard problem and no exact algorithm to solve it exactly in polynomial time is known to exist. Several heuristic approaches have been proposed to find approximate solution...

(This article belongs to the Section D1: Probability and Statistics)
  • Article
  • Open Access
3 Citations
2,452 Views
19 Pages

DAG Hierarchical Schedulability Analysis for Avionics Hypervisor in Multicore Processors

  • Huan Yang,
  • Shuai Zhao,
  • Xiangnan Shi,
  • Shuang Zhang and
  • Yangming Guo

21 February 2023

Parallel hierarchical scheduling of multicore processors in avionics hypervisor is being studied. Parallel hierarchical scheduling utilizes modular reasoning about the temporal behavior of the upper Virtual Machine (VM) by partitioning CPU time. Dire...

(This article belongs to the Special Issue Advanced Technology of Intelligent Control and Simulation Evaluation)
  • Article
  • Open Access
1 Citations
738 Views
20 Pages

This paper presents a comprehensive performance analysis and practical implementation of a parallel algorithm for constructing bifurcation diagrams of the fractional Selkov oscillator with variable coefficients and memory (SFO). The primary contribut...

(This article belongs to the Topic Fractional Calculus: Theory and Applications, 2nd Edition)
  • Article
  • Open Access
3 Citations
1,720 Views
11 Pages

A Modified Parallel Algorithm for a Common Fixed-Point Problem with Application to Signal Recovery

  • Anchalee Khemphet,
  • Raweerote Suparatulatorn,
  • Pariwate Varnakovida and
  • Phakdi Charoensawan

24 July 2023

In this work, an algorithm is introduced for the problem of finding a common fixed point of a finite family of G-nonexpansive mappings in a real Hilbert space endowed with a directed graph G. This algorithm is a modified parallel algorithm inspired b...

(This article belongs to the Special Issue Symmetry in Functional Equations and Analytic Inequalities III)
  • Article
  • Open Access
293 Views
22 Pages

Modern communication networks may provide several heterogeneous links between the same pair of devices, including Wi-Fi, 5G, Bluetooth, and SparkLink. Existing multicast schemes often use simple-graph abstractions and therefore cannot distinguish the...

  • Article
  • Open Access
11 Citations
4,962 Views
19 Pages

Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics

  • Hristo N. Djidjev,
  • Georg Hahn,
  • Susan M. Mniszewski,
  • Christian F. A. Negre and
  • Anders M. N. Niklasson

7 September 2019

The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several advanced algor...

  • Article
  • Open Access
32 Citations
10,909 Views
18 Pages

3 October 2013

We present a threaded parallel adaptation of a state-of-the-art maximum clique algorithm for dense, computationally challenging graphs. We show that near-linear speedups are achievable in practice and that superlinear speedups are common. We include...

(This article belongs to the Special Issue Algorithms for Multi Core Parallel Computation)
  • Article
  • Open Access
6 Citations
2,854 Views
16 Pages

9 March 2023

In graph theory, a “dominating vertex set” is a subset of vertices in a graph such that every vertex in the graph is either a member of the subset or adjacent to a member of the subset. In other words, the vertices in the dominating set &...

(This article belongs to the Section Logic)
  • Article
  • Open Access
49 Views
49 Pages

7 November 2026

The multi-objective traveling salesman problem (MOTSP) is a typical challenging multi-objective combinatorial optimization problem. Numerous advanced deep reinforcement learning algorithms have been developed to solve it. Existing learning-based meth...

(This article belongs to the Special Issue Fuzzy Evolutionary Computation for Big Data Analytics and Intelligent Decision Making)
  • Article
  • Open Access
2,813 Views
12 Pages

Graphs are used as models to solve problems in fields such as mathematics, computer science, physics, and chemistry. In particular, torus, hypercube, and star graphs are popular when modeling the connection structure of processors in parallel computi...

(This article belongs to the Section Computer Science & Engineering)
  • Article
  • Open Access
6 Citations
3,642 Views
21 Pages

Adaptive Distributed Parallel Training Method for a Deep Learning Model Based on Dynamic Critical Paths of DAG

  • Yan Zeng,
  • Wei Wang,
  • Yong Ding,
  • Jilin Zhang and ,
  • Yongjian Ren and
  • Guangzheng Yi
  • + 1 author+ 0 author

16 December 2022

AI provides a new method for massive simulated data calculations in molecular dynamics, materials, and other scientific computing fields. However, the complex structures and large-scale parameters of neural network models make them difficult to devel...

(This article belongs to the Special Issue Artificial Intelligence and Scientific Computing: Mathematical Techniques and Applications)
  • Article
  • Open Access
26 Citations
9,160 Views
19 Pages

30 September 2023

Biological networks such as protein interaction networks, gene regulation networks, and metabolic pathways are examples of complex networks that are large graphs with small-world and scale-free properties. An analysis of these networks has a profound...

(This article belongs to the Special Issue Graph Theory and Its Applications in Computing)
  • Article
  • Open Access
48 Citations
8,377 Views
18 Pages

An Efficient Parallel Multi-Scale Segmentation Method for Remote Sensing Imagery

  • Haiyan Gu,
  • Yanshun Han,
  • Yi Yang,
  • Haitao Li and ,
  • Zhengjun Liu,
  • Uwe Soergel,
  • Thomas Blaschke and
  • Shiyong Cui
  • + 3 authors+ 0 author

11 April 2018

Remote sensing (RS) image segmentation is an essential step in geographic object-based image analysis (GEOBIA) to ultimately derive “meaningful objects”. While many segmentation methods exist, most of them are not efficient for large data sets. Thus,...

  • Article
  • Open Access
7 Citations
9,637 Views
13 Pages

One-to-One Embedding between Honeycomb Mesh and Petersen-Torus Networks

  • Jung-Hyun Seo,
  • Hyun Sim,
  • Dae-Heon Park,
  • Jang-Woo Park and
  • Yang-Sun Lee

1 February 2011

As wireless mobile telecommunication bases organize their structure using a honeycomb-mesh algorithm, there are many studies about parallel processing algorithms like the honeycomb mesh in Wireless Sensor Networks. This paper aims to study the Peters...

(This article belongs to the Section Physical Sensors)
  • Article
  • Open Access
7 Citations
1,960 Views
16 Pages

20 June 2022

This article considers a parallel monotone hybrid algorithm for a finite family of G-nonexpansive mapping in Hilbert spaces endowed with graphs and suggests iterative schemes for finding a common fixed point by the two different hybrid projection met...

(This article belongs to the Section E1: Mathematics and Computer Science)

of 4