Wednesday, March 17, 2021

[DMANET] Call for Contributions: [Algorithms, MDPI] Special Issue "Scalable Graph Algorithms and Applications"

We are pleased to announce the launch of a new Special Issue dedicated to
"Scalable Graph Algorithms and Applications" in the journal Algorithms,
an *EI-*, *ESCI-*, and *Scopus-indexed* open access journal.

Journal: Algorithms (

Special issue on "Scalable Graph Algorithms and Applications"

Guest Editors: Dr. Deepak Ajwani, Dr. Sabine Storandt and Dr. Darren Strash

Submission deadline: 30 June 2021. Papers will be published
on an ongoing basis, so you can submit your paper at any point before
the deadline.

We invite you to submit your latest research in the area of scalable graph
algorithms to the Special Issue, "Scalable Graph Algorithms and
Applications". We solicit high-quality papers to address both algorithm
design and algorithm engineering issues related to the processing of large
graphs. We consider scalability in a broad sense: (i) for near linear-time
graph algorithms such as those related to traversal and shortest-paths,
scalability refers to algorithms that address issues of cache-efficiency,
I/O-efficiency, GPU parallelism, shared memory parallelism, and distributed
algorithms; (ii) for polynomial-time graph algorithms such as those related
to matching, flow and centrality computation, scalability refers to the
exact and approximate algorithms that scale to millions of nodes and edges;
(iii) For NP-hard graph problems such as those related to subgraph pattern
matching, scalability refers to the design and engineering of heuristics
that are capable of dealing with graphs that have thousands of nodes and
tens of thousands of edges. We also invite submissions related to
applications of scalable graph algorithms in areas such as social network
analysis, navigation systems and sustainable transportation, querying and
mining knowledge graphs, semantic web, recommendation systems, financial
and economic networks, network epidemic models, bioinformatics, and earth
sciences applications.

Topics of interest include (but are not limited to) the following:

- Cache-efficient graph algorithms
- I/O-efficient graph algorithms
- Shared-memory multicore graph algorithms
- Distributed memory graph algorithms
- Graph algorithms for GPUs
- Streaming graph algorithms
- Randomized graph algorithms
- Approximate graph algorithms
- Dynamic graph algorithms
- Algorithms for large-scale network analytics
- Scalable graph mining
- Efficient heuristics for NP-hard graph problems
- Models for real-world graphs
- Generation of large graph instances
- Simulations involving large graphs
- Applications of large graphs in social network analysis, navigation
systems and sustainable transportation, querying and mining knowledge
graphs, etc.

Prospective authors are encouraged to contact the guest-editors as soon as

Manuscript Submission Information
Submitted manuscripts should not have been published previously, nor be
under consideration for publication elsewhere, except conference
proceedings papers. In the latter case (of conference proceedings papers),
the submitted manuscript should provide enough new content.

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
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 1400 CHF (Swiss Francs).
Submitted papers should be well formatted and use good English. Authors may
MDPI's English editing service ( prior
to publication or during author revisions.

* Contributions to be spread via DMANET are submitted to
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.