Workshop on Graph Computation Models

被引:0
|
作者
Mosbah, Mohamed [1 ]
Habel, Annegret [2 ]
机构
[1] Univ Bordeaux 1, LaBRI, ENSEIRB, 351 Cours Liberat, F-33405 Talence, France
[2] Carl von Ossietzky Univ Oldenburg, Fac Informat, D-26111 Oldenburg, Germany
来源
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A variety of computation models have been developed using graphs and graph transformations. These include models for sequential, distributed, parallel or mobile computation. A graph may represent, in an abstract way, the underlying structure of a computer system, or it may stand for the computation steps running on such a system. In the former, the computation can be carried on the corresponding graph, implying a simplification of the complexity of the system. The aim of the workshop is to bring together researchers interested in all aspects of computation models based on graphs, and their applications. A particular emphasis will be made for models and tools describing general solutions.
引用
收藏
页码:460 / +
页数:2
相关论文
共 50 条
  • [1] Workshop on graph computation models
    Metivier, Yves
    Mosbah, Mohamed
    [J]. GRAPH TRANSFORMATIONS, PROCEEDINGS, 2006, 4178 : 463 - 464
  • [2] Ninth International Workshop on Graph Computation Models (GCM 2018)
    Kreowski, Hans-Joerg
    [J]. SOFTWARE TECHNOLOGIES: APPLICATIONS AND FOUNDATIONS, 2018, 11176 : 396 - 397
  • [3] Workshop on algorithms and models for the web graph
    Aiello, William
    Broder, Andrei
    Janssen, Jeannette
    Milios, Evangelos
    [J]. ALGORITHMS AND MODELS FOR THE WEB-GRAPH, 2008, 4936 : 18 - +
  • [4] MODELS OF COMPUTATION OF A MULTIALTERNATIVE PREDICTION GRAPH ON THE BASIS OF ANALYTICAL ESTIMATES
    Skobets, T. Ya.
    [J]. CYBERNETICS AND SYSTEMS ANALYSIS, 2005, 41 (02) : 233 - 245
  • [5] MODELS OF COMPUTATION SYSTEMS-CYCLIC TO ACYCLIC GRAPH TRANSFORMATIONS
    MARTIN, DE
    ESTRIN, G
    [J]. IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1967, EC16 (01): : 70 - &
  • [6] AN INVESTIGATION OF PARALLEL COMPUTATION MODELS FOR STUDIES OF ORIENTED GRAPH STRUCTURE
    GRUNDSPENKIS, YA
    [J]. SOVIET MICROELECTRONICS, 1981, 10 (04): : 150 - 154
  • [7] Parallel computation of the reachability graph of petri net models with semantic information
    de Murillas, Eduardo Gonzalez-Lopez
    Fabra, Javier
    Alvarez, Pedro
    Ezpeleta, Joaquin
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 2017, 47 (05): : 647 - 668
  • [8] Median graph computation for graph clustering
    Hlaoui, A
    Wang, SR
    [J]. SOFT COMPUTING, 2006, 10 (01) : 47 - 53
  • [9] Median graph computation for graph clustering
    Adel Hlaoui
    Shengrui Wang
    [J]. Soft Computing, 2006, 10 : 47 - 53
  • [10] Approximate Bayesian Computation for Exponential Random Graph Models for Large Social Networks
    Wang, Jing
    Atchade, Yves F.
    [J]. COMMUNICATIONS IN STATISTICS-SIMULATION AND COMPUTATION, 2014, 43 (02) : 359 - 377