A special issue of Theoretical Computer Science on Link Streams: Models and Algorithm
摘要截稿:
全文截稿: 2018-07-01
影响因子: 0.747
期刊难度:
CCF分类: B类
中科院JCR分区:
• 大类 : 计算机科学 - 4区
• 小类 : 计算机:理论方法 - 4区
Overview
Money or data tansfers, contacts between individuals, product sales, network traffic, messages, or travels may all be modeled as link streams, i.e. sequences of links with temporal information. Studying the structure and dynamics of such streams is therefore crucial for many fundamental and applied questions. This raises many challenging issues, which are at the core of an intense research activity currently, with contributions from graph theory, combinatorics, probabilities, complex networks, signal processing, and others.
This special issue is devoted to all aspects of modeling and algorithmic challenges raised by link streams. It aims at promoting theoretical computer science research on these topics by putting together competing and complementary approaches, identify key results, methods, and directions, as well as encourage the convergence of these diverse work.
Topics of interest include, but are not limited to:
· algorithms and data structures for link streams
· algorithmic challenges raised by link streams
· formal models for link streams, random link streams
· complexity of link streams problems
· properties of link streams, descriptive statistics
· compact and efficient encodings of link streams
· on-line, streaming, and external memory algorithms for link streams
· heuristics, approximations and sampling in link streams