Proceedings 16th International Workshop on Graph Computation Models
- URL: http://arxiv.org/abs/2601.03249v1
- Date: Tue, 06 Jan 2026 18:47:06 GMT
- Title: Proceedings 16th International Workshop on Graph Computation Models
- Authors: Leen Lambers, Oszkár Semeráth,
- Abstract summary: This volume contains the post-proceedings of the Sixteenth International Workshop on Graph Computation Models (GCM 2025)<n>The workshops took place in Koblenz, Germany on June 10 as part of STAF (Software Technologies: Applications and Foundations)
- Score: 1.7546369508217285
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This volume contains the post-proceedings of the Sixteenth International Workshop on Graph Computation Models (GCM 2025). The workshops took place in Koblenz, Germany on June 10 as part of STAF (Software Technologies: Applications and Foundations). Graphs are common mathematical structures that are visual and intuitive. They constitute a natural and seamless way for system modeling in science, engineering, and beyond, including computer science, biology, and business process modeling. Graph computation models constitute a class of very high-level models where graphs are first-class citizens. The aim of the International GCM Workshop series is to bring together researchers interested in all aspects of computation models based on graphs and graph transformation. It promotes the cross-fertilizing exchange of ideas and experiences among senior and young researchers from the different communities interested in the foundations, applications, and implementations of graph computation models and related areas.
Related papers
- Beyond MMD: Evaluating Graph Generative Models with Geometric Deep Learning [0.0]
Graph Generative Models (GGMs) have emerged as a promising solution to the problem of generating realistic graphs.<n>This paper introduces a novel methodology for evaluating GGMs that overcomes the limitations of Maximum Mean Discrepancy (MMD)<n>We present a comprehensive evaluation of two state-of-the-art Graph Generative Models: Graph Recurrent Attention Networks (GRAN) and Efficient and Degree-guided graph GEnerative model (EDGE)
arXiv Detail & Related papers (2025-12-16T09:51:44Z) - Proceedings of the Fourteenth and Fifteenth International Workshop on Graph Computation Models [0.0]
The workshops took place in Leicester, UK on 18th July 2023 and Enschede, the Netherlands on 9th July 2024.<n>The aim of the International GCM Workshop series is to bring together researchers interested in all aspects of computation models based on graphs and graph transformation.
arXiv Detail & Related papers (2025-03-25T13:19:26Z) - Thinking like a CHEMIST: Combined Heterogeneous Embedding Model Integrating Structure and Tokens [42.203344899915464]
We present a novel approach that decomposes molecules into substructures and computes descriptor-based representations for these fragments.<n>We use this substructure and descriptor data as input for language model and also propose a bimodal architecture that integrates this language model with graph-based models.
arXiv Detail & Related papers (2025-02-25T08:53:18Z) - Graph Foundation Models: Concepts, Opportunities and Challenges [66.37994863159861]
Foundation models have emerged as critical components in a variety of artificial intelligence applications.<n>The capabilities of foundation models in generalization and adaptation motivate graph machine learning researchers to discuss the potential of developing a new graph learning paradigm.<n>This article introduces the concept of Graph Foundation Models (GFMs), and offers an exhaustive explanation of their key characteristics and underlying technologies.
arXiv Detail & Related papers (2023-10-18T09:31:21Z) - Graph Meets LLMs: Towards Large Graph Models [60.24970313736175]
We present a perspective paper to discuss the challenges and opportunities associated with developing large graph models.
First, we discuss the desired characteristics of large graph models.
Then, we present detailed discussions from three key perspectives: representation basis, graph data, and graph models.
arXiv Detail & Related papers (2023-08-28T12:17:51Z) - Connector 0.5: A unified framework for graph representation learning [5.398580049917152]
We introduce a novel graph representation framework covering various graph embedding models, ranging from shallow to state-of-the-art models.
We plan to build an efficient open-source framework that can provide deep graph embedding models to represent structural relations in graphs.
arXiv Detail & Related papers (2023-04-25T23:28:38Z) - Curriculum Graph Machine Learning: A Survey [51.89783017927647]
curriculum graph machine learning (Graph CL) integrates the strength of graph machine learning and curriculum learning.
This paper comprehensively overview approaches on Graph CL and present a detailed survey of recent advances in this direction.
arXiv Detail & Related papers (2023-02-06T16:59:25Z) - Generative Diffusion Models on Graphs: Methods and Applications [50.44334458963234]
Diffusion models, as a novel generative paradigm, have achieved remarkable success in various image generation tasks.
Graph generation is a crucial computational task on graphs with numerous real-world applications.
arXiv Detail & Related papers (2023-02-06T06:58:17Z) - A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic,
and Multimodal [57.8455911689554]
Knowledge graph reasoning (KGR) aims to deduce new facts from existing facts based on mined logic rules underlying knowledge graphs (KGs)
It has been proven to significantly benefit the usage of KGs in many AI applications, such as question answering, recommendation systems, and etc.
arXiv Detail & Related papers (2022-12-12T08:40:04Z) - Graph Pooling for Graph Neural Networks: Progress, Challenges, and
Opportunities [128.55790219377315]
Graph neural networks have emerged as a leading architecture for many graph-level tasks.
graph pooling is indispensable for obtaining a holistic graph-level representation of the whole graph.
arXiv Detail & Related papers (2022-04-15T04:02:06Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.