Extreme Algorithmics: Analysis of Huge, Noisy, and Dynamic Networked Data
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 (30 April 2022) | Viewed by 2234
Special Issue Editors
Interests: algorithmic game theory; network creation games; Schelling games; fault-tolerant networks; graph spanners; distance oracles; approximation algorithms for np-hard problems
Special Issues, Collections and Topics in MDPI journals
Interests: algorithm engineering; graph drawing; network visualization; computer networks
Special Issues, Collections and Topics in MDPI journals
Special Issue Information
Dear Colleagues,
The analysis of graphs and networks is an intriguing research field with a consolidated literature. It comprises connectivity computations, simplification through filtering, sampling and clustering, identification of hubs and authorities, visualization techniques, etc. Applications include networking, biology, economics, and sociology. However, recent challenges defy the research community. One well-known challenge is the size of real-world networks that sometimes rule out the adoption of traditional algorithms. A second challenge is bought by uncertain and noisy information that makes exact solutions questionable and calls for more flexible models. A third challenge is heterogeneous data that asks for tailored solutions. A further challenge is dynamic data, sometimes evolving over time, sometimes provided in a streaming fashion, forcing the analysis to take into account the temporal dimension.
This Special Issue is dedicated to models and algorithms for the analysis of real-world networks especially devised to cope with the mentioned challenges. Submissions should present original approaches and significant contributions and could contain methodological issues, model proposals, complexity analyses, experimental evaluations, and application-driven case studies.
Dr. Davide Bilò
Prof. Dr. Maurizio Patrignani
Guest Editors
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
- Analysis of large graphs and networks
- Visual analysis of networked data
- Uncertain, noisy, and heterogeneous information
- Dynamic algorithms
