Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.9
2.7
Journals
Symmetry
Special Issues
Graph Algorithms and Graph Theory II
share announcement

Graph Algorithms and Graph Theory II

A special issue of Symmetry (ISSN 2073-8994). This special issue belongs to the section "Mathematics".

Deadline for manuscript submissions: closed (31 May 2023) | Viewed by 7515

Special Issue Editor

Dr. Manuel Lafond

E-Mail Website
Guest Editor
Department of Computer Science, Université de Sherbrooke, Sherbrooke, QC, Canada
Interests: algorithms; computational biology; graph theory; parameterized complexity; approximation algorithms
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Following the success of the first Special Issue of Symmetry, titled Graph Algorithms and Graph Theory, it is my pleasure to be the Guest Editor for a second Special Issue. 

Graphs have applications in numerous areas of computer science, including machine learning, computational biology, social network analysis, and many other areas, which all require fast algorithms for various optimization problems. Recent advances in graph theory have shown that most graphs exhibit structural properties or symmetry that can be leveraged for the development of efficient algorithms. To cite a few examples, minor theory has paved the way for countless results in parameterized complexity, and several regularity lemmata have spurred several new ideas in approximation algorithms. Moreover, these results represent only a fraction of the algorithmic applications of structural graph theory that have emerged over the last few decades. This demonstrates that expanding our fundamental knowledge of graphs, whether it be graphs in general or specific classes, is necessary in order to improve the state-of-the-art in algorithms and complexity.

This Special Issue aims to improve our understanding of the interplay between algorithms, structure, and symmetry in graphs. The goal is to explore new directions in designing graph algorithms and to establish new foundations in structural graph theory.

The scope of the Special Issue includes, but is not limited to:

  • the design and analysis of graph algorithms, as well as parallel, randomized, parameterized, distributed, and other types of algorithms;
  • structural graph theory with immediate or potential applications in algorithms and complexity analysis.

Dr. Manuel Lafond
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Symmetry is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Published Papers (6 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

10 pages, 308 KiB  
Article
A Vulnerability Measure of k-Uniform Linear Hypergraphs
by Ning Zhao, Haixing Zhao and Yinkui Li
Symmetry 2023, 15(6), 1187; https://doi.org/10.3390/sym15061187 - 02 Jun 2023
Cited by 1 | Viewed by 776
Abstract
Vulnerability refers to the ability of a network to continue functioning when part of the network is either naturally damaged or targeted for attack. In this paper, the rupture degree of graphs is employed to measure the vulnerability of uniform linear hypergraphs. First, [...] Read more.
Vulnerability refers to the ability of a network to continue functioning when part of the network is either naturally damaged or targeted for attack. In this paper, the rupture degree of graphs is employed to measure the vulnerability of uniform linear hypergraphs. First, we discuss the bounds of the rupture degrees of k-uniform linear hypergraphs. Then, we give a recursive algorithm for computing the rupture degree of k-uniform hypertrees. Full article
(This article belongs to the Special Issue Graph Algorithms and Graph Theory II)
►▼ Show Figures

Figure 1

10 pages, 258 KiB  
Article
A Novel Problem for Solving Permuted Cordial Labeling of Graphs
by Ashraf ELrokh, Mohammed M. Ali Al-Shamiri, Mohammed M. A. Almazah and Atef Abd El-hay
Symmetry 2023, 15(4), 825; https://doi.org/10.3390/sym15040825 - 29 Mar 2023
Viewed by 1157
Abstract
In this paper, we used the permutation group together with the concept of cordiality in graph theory to introduce a new method of labeling. This construed permuted cordial labeling can be applied to all paths, cycles, fans and wheel graphs. Moreover, some other [...] Read more.
In this paper, we used the permutation group together with the concept of cordiality in graph theory to introduce a new method of labeling. This construed permuted cordial labeling can be applied to all paths, cycles, fans and wheel graphs. Moreover, some other properties are investigated and show that the union of any two paths and the union of any two cycles are permuted cordial graphs. In addition, we investigated the permuted cordiality for the union of any path with cycle. Full article
(This article belongs to the Special Issue Graph Algorithms and Graph Theory II)
13 pages, 419 KiB  
Article
GCAT-GTCU: Graph-Connected Attention Network and Gate Than Change Unit for Aspect-Level Sentiment Analysis
by Chunming Ma, Xiuhong Li, Huiru Wang and Ying Zheng
Symmetry 2023, 15(2), 309; https://doi.org/10.3390/sym15020309 - 22 Jan 2023
Viewed by 1295
Abstract
Currently, attention mechanisms are widely used in aspect-level sentiment analysis tasks. Previous studies have only used attention mechanisms combined with neural networks for aspect-level sentiment classification, and the feature extraction of the model is insufficient. When the same aspect and sentiment polarity appear [...] Read more.
Currently, attention mechanisms are widely used in aspect-level sentiment analysis tasks. Previous studies have only used attention mechanisms combined with neural networks for aspect-level sentiment classification, and the feature extraction of the model is insufficient. When the same aspect and sentiment polarity appear in multiple sentences, the semantic information sharing of the same domain is also ignored, resulting in low model performance. To address these problems, the paper proposes an aspect-level sentiment analysis model, GCAT-GTCU, which combines a Graph-connected Attention Network containing symmetry with Gate Than Change Unit. Three nodes of words, sentences, and aspects are constructed, and local and deep-level features of sentences are extracted using CNN splicing BiGRU; node connection information is added to GAT to form a GCAT containing symmetry to realize the information interaction of three nodes, pay attention to the contextual information, and update the shared information of three nodes at any time; a new gating mechanism GTCU is constructed to filter noisy information and control the flow of sentiment information; finally, the three nodes are extracted information to predict the final sentiment polarity. The experimental results on four publicly available datasets show that the model outperforms the baseline model against which it is compared in some very controlled situations. Full article
(This article belongs to the Special Issue Graph Algorithms and Graph Theory II)
►▼ Show Figures

Figure 1

13 pages, 608 KiB  
Article
Calculating Crossing Numbers of Graphs Using Their Redrawings
by Michal Staš
Symmetry 2023, 15(1), 175; https://doi.org/10.3390/sym15010175 - 07 Jan 2023
Viewed by 1089
Abstract
The main aim of the paper is to give the crossing number of the join product G*+Dn. The connected graph G* of order six is isomorphic to K3,3\e obtained by removing one [...] Read more.
The main aim of the paper is to give the crossing number of the join product G*+Dn. The connected graph G* of order six is isomorphic to K3,3\e obtained by removing one edge from the complete bipartite graph K3,3, and the discrete graph Dn consists of n isolated vertices. The proofs were carried out with the help of several possible redrawings of the graph G* with respect to its many symmetries. Full article
(This article belongs to the Special Issue Graph Algorithms and Graph Theory II)
►▼ Show Figures

Figure 1

12 pages, 285 KiB  
Article
Typical Structure of Oriented Graphs and Digraphs with Forbidden Blow-Up Transitive Triangles
by Meili Liang and Jianxi Liu
Symmetry 2022, 14(12), 2551; https://doi.org/10.3390/sym14122551 - 02 Dec 2022
Viewed by 843
Abstract
Transitive tournament (including transitive triangle) and its blow-up have some symmetric properties. In this work, we establish an analogue result of the Erdös-Stone theorem of weighted digraphs with a forbidden blow-up of the transitive tournament. We give a stability result of oriented graphs [...] Read more.
Transitive tournament (including transitive triangle) and its blow-up have some symmetric properties. In this work, we establish an analogue result of the Erdös-Stone theorem of weighted digraphs with a forbidden blow-up of the transitive tournament. We give a stability result of oriented graphs and digraphs with forbidden blow-up transitive triangles and show that almost all oriented graphs and digraphs with forbidden blow-up transitive triangles are almost bipartite, which reconfirms and strengthens the conjecture of Cherlin. Full article
(This article belongs to the Special Issue Graph Algorithms and Graph Theory II)
15 pages, 386 KiB  
Article
On Three-Rainbow Dominationof Generalized Petersen Graphs P(ck,k)
by Darja Rupnik Poklukar and Janez Žerovnik
Symmetry 2022, 14(10), 2086; https://doi.org/10.3390/sym14102086 - 07 Oct 2022
Cited by 4 | Viewed by 1135
Abstract
New results on singleton rainbow domination numbers of generalized Petersen graphs P(ck,k) are given. Exact values are established for some infinite families, and lower and upper bounds with small gaps are given in all other cases. Full article
(This article belongs to the Special Issue Graph Algorithms and Graph Theory II)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-6
Back to TopTop