Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.1
1.8
Journals
Algorithms
Special Issues
Graph Algorithms and Applications
share announcement

Graph Algorithms and Applications

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Combinatorial Optimization, Graph, and Network Algorithms".

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

Special Issue Editor

Dr. Chia-Wei Lee

E-Mail Website
Guest Editor
Department of Computer Science and Information Engineering, National Taitung University, Taitung 95092, Taiwan
Interests: graph theory and algorithms; interconnection networks; fault-tolerant computing; system-level diagnosis; design and analysis of algorithms
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Graphs arise in various real-world situations as there are road networks, computer networks, and (most recently) social networks. Graphs are also popular in NLP and machine learning to form networks. The Special Issue on “Graph Algorithms and Applications” aims to showcase the excellent ideas, latest innovations, and experiences (in designing and analyzing graph algorithms) of international researchers. We are looking for new and innovative approaches for solving graph problems exactly or approximately. High-quality papers are solicited to address both theoretical and practical issues of graph algorithms. Submissions are welcome, both for traditional graph problems, as well as new applications.

We invite you to submit high-quality papers to this Special Issue on “Graph Algorithms and Applications”, with subjects covering theory and applications. The following is a (non-exhaustive) list of topics of interests:

  • Applications of graph and network algorithms;
  • Computer and interconnection networks;
  • Design and analysis of graph algorithms;
  • Exact and approximation graph algorithms;
  • Experiences with graph and network algorithms;
  • Graph embedding and layout;
  • Network optimization;
  • Social networks;
  • Telecommunication networks;
  • VLSI circuits.

Dr. Chia-Wei Lee
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. Algorithms 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 1600 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.

Keywords

  • applications of graphs
  • approximation graph algorithms
  • design and analysis of graph algorithms
  • exact graph algorithms
  • experiences with graph and network algorithms
  • graph embedding and layout
  • heuristic graph algorithms
  • interconnection networks
  • network optimization
  • social networks
  • telecommunication networks
  • VLSI circuits

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (2 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

19 pages, 13602 KiB  
Article
On Orthogonal Double Covers and Decompositions of Complete Bipartite Graphs by Caterpillar Graphs
by Ahmed El-Mesady, Tasneem Farahat, Ramadan El-Shanawany and Aleksandr Y. Romanov
Algorithms 2023, 16(7), 320; https://doi.org/10.3390/a16070320 - 29 Jun 2023
Cited by 1 | Viewed by 1515
Abstract
Nowadays, graph theory is one of the most exciting fields of mathematics due to the tremendous developments in modern technology, where it is used in many important applications. The orthogonal double cover (ODC) is a branch of graph theory [...] Read more.
Nowadays, graph theory is one of the most exciting fields of mathematics due to the tremendous developments in modern technology, where it is used in many important applications. The orthogonal double cover (ODC) is a branch of graph theory and is considered as a special class of graph decomposition. In this paper, we decompose the complete bipartite graphs Kx,x by caterpillar graphs using the method of ODCs. The article also deals with constructing the ODCs of Kx,x by general symmetric starter vectors of caterpillar graphs such as stars–caterpillar, the disjoint copies of cycles–caterpillars, complete bipartite caterpillar graphs, and the disjoint copies of caterpillar paths. We decompose the complete bipartite graph by the complete bipartite subgraphs and by the disjoint copies of complete bipartite subgraphs using general symmetric starter vectors. The advantage of some of these new results is that they enable us to decompose the giant networks into large groups of small networks with the comprehensive coverage of all parts of the giant network by using the disjoint copies of symmetric starter subgraphs. The use case of applying the described theory for various applications is considered. Full article
(This article belongs to the Special Issue Graph Algorithms and Applications)
►▼ Show Figures

Figure 1

16 pages, 530 KiB  
Article
The t/k-Diagnosability and a t/k Diagnosis Algorithm of the Data Center Network BCCC under the MM* Model
by Jialiang Lu, Wei Zhao and Jie Li
Algorithms 2022, 15(12), 480; https://doi.org/10.3390/a15120480 - 16 Dec 2022
Cited by 1 | Viewed by 1846
Abstract
The evaluation of the fault diagnosis capability of a data center network (DCN) is important research in measuring network reliability. The g-extra diagnosability is defined under the condition that every component except the fault vertex set contains at least g+1 vertices. The t/k [...] Read more.
The evaluation of the fault diagnosis capability of a data center network (DCN) is important research in measuring network reliability. The g-extra diagnosability is defined under the condition that every component except the fault vertex set contains at least g+1 vertices. The t/k diagnosis strategy is that the number of fault nodes does not exceed t, and all fault nodes can be isolated into a set containing up to k fault-free nodes. As an important data center network, BCube Connected Crossbars (BCCC) has many excellent properties that have been widely studied. In this paper, we first determine that the g-extra connectivity of BCn,k for 0≤g≤n−1. Based on this, we establish the g-extra conditional diagnosability of BCn,k under the MM* model for 1≤g≤n−1. Next, based on the conclusion of the largest connected component in g-extra connectivity, we prove that the t/k-diagnosability of BCn,k under the MM* model for 1≤k≤n−1. Finally, we present a t/k diagnosis algorithm on BCCC under the MM* model. The algorithm can correctly identify all nodes at most k nodes undiagnosed. So far, t/k-diagnosability and diagnosis algorithms for most networks in the MM* model have not been studied. Full article
(This article belongs to the Special Issue Graph Algorithms and Applications)
►▼ 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-2
Back to TopTop