Sunday, February 18, 2018

[DMANET] CFP: Theoretical Computer Science Special Issue on "Metrics in Graphs and its Applications" - SUBMISSION OPEN

[Apologies in advance for multiple postings]
CALL FOR PAPERS

THEORETICAL COMPUTER SCIENCE
Special Issue on "Metrics in Graphs and its Applications"
https://www.journals.elsevier.com/theoretical-computer-science/call-for-papers/special-issue-on-metrics-in-graphs-and-its-applications

**************  THE SUBMISSION SYSTEM IS NOW OPEN ****************


Graph structures are used to model computer networks. Servers, hosts or 
hubs in a network represent vertices in a graph and edges represent
connections between them. Each vertex in a graph is a possible location 
for an intruder (fault in a computer network, spoiled device) and, in
this sense, a correct surveillance of each vertex of the graph to
control such a possible intruder is worthwhile. According to these
facts, it is desirable to uniquely recognize each vertex of the graph.
In connection with this problem, the notion of metric generators (also
called resolving sets or locating sets) were introduced in the 1970's
and, due to this, the concept of metric dimension in graphs is nowadays
well studied, which is also somehow based on the fact that the number of
researchers on the topic have significantly increased in the last two
decades.

Some of the most frequent studies on metric dimension (and all its
variants) concern its applications to several real problems and/or its
computational and combinatorial properties. In this sense, the main goal
of this special issue of Theoretical Computer Science is devoted to
collect several interesting and groundbreaking papers on metric
dimension and its related variants which are dealing with its
applications in computer sciences and its computational and
combinatorial properties as well.

All interested researchers are invited to contribute to this special
issue. The topics should relate to metric dimension and should contain
applications to computer science problems, or computational and
combinatorial aspects of it.

All articles will be thoroughly refereed according to the standards of
Theoretical Computer Science. The full papers must be submitted through
the Elsevier Editorial System
(https://ees.elsevier.com/tcs/default.asp). When submitting your paper,
be sure to specify that the paper is a contribution for the Special
Issue: Metrics in Graphs and its Applications, so that your paper will
be assigned to the guest editors. Please see the Author Instructions on
the site if you have not yet submitted a paper through this web-based
system. Be sure to note that your work is intended for the Special Issue
and to select the article type SI: MeGA.

We are looking forward to receiving your contribution.

The Guest Editors,

Ismael González Yero
University of Cadiz, Spain

Dorota Kuziak
University of Cadiz, Spain

Juan Alberto Rodríguez Velázquez
Rovira i Virgili University, Spain


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* 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.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************