<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>E. F. Codd, A relational model of data for large shared data banks, Communications of the ACM</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.1007/978-3-319-67771-2</article-id>
      <title-group>
        <article-title>Graphs: Approaches and Challenges</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Philipp Plamper</string-name>
          <email>philipp.plamper@hs-anhalt.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anika Groß</string-name>
          <email>anika.gross@hs-anhalt.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Knowledge Graph, Spatio-Temporal Knowledge Graph, Knowledge Representation, History</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Anhalt University of Applied Sciences, Department Computer Science and Languages</institution>
          ,
          <addr-line>Köthen (Anhalt), 06366</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <volume>13</volume>
      <issue>1970</issue>
      <fpage>377</fpage>
      <lpage>387</lpage>
      <abstract>
        <p>Knowledge graphs capture interconnected information by representing entities and their relationships to each other within graph structures. Specifically, spatio-temporal knowledge graphs gain increasing interest. They enable detailed modeling of many real-world systems in which time and space often play a crucial role, such as ecology, climate change and both local and global infrastructures. Previous relevant research in this area is diverse and influenced by diferent, rather distant research communities such as computer science and geography, making it challenging and complex to review the field. Due to the diversity of research and the complexity of spatiotemporal knowledge graphs, there are still many gaps that need to be explored to gain a more comprehensive understanding along their whole life cycle including the modeling, creation, management and analysis. On the one hand there is a need for generic concepts and methods, while on the other hand applications can have complex and varying requirements specific to a domain. Our goal is to develop spatio-temporal knowledge graphs and analysis methods with a focus on the requirements in the field of ecology and restoration in agricultural landscapes. In this paper, we initially provide a historical overview of key influences in the development of spatio-temporal knowledge graphs. We then outline challenges and give an overview of our approach and planned research in this field.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In many domains knowledge graphs are used to represent inherently interconnected systems in a
graph structure, e.g. social networks, computer networks or chemical networks [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] as illustrated in
provides a semantically enriched network representation to support interoperability and improved
querying. Often knowledge graphs are represented based on the property graph model or the Resource
Description Framework [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and are used for many network analysis tasks, including the emerging field
of deep learning on graphs [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] e.g. for completion, recommendation or question answering.
      </p>
      <p>
        Spatio-temporal knowledge graphs (STKG) additionally cover spatial and temporal properties. They
thus form a combined approach of spatial [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and temporal [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] knowledge graphs allowing to represent
systems, which are influenced by both properties. There is a wide field of possible applications of
STKG such as urban networks to predict trafic flow patterns in a city [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], medical networks to model
the progression and spread of infectious diseases [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] and ecological networks to predict forest fire in
diferent regions [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Due to their complexity, the modeling, construction, evaluation and analysis of
STKG of high-quality based on real-world data is a challenging process, and requires in-depth research.
      </p>
      <p>
        So far urban networks [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] receive particular focus in STKG research as complex systems with
wellknown nodes and relationships on the spatial scale and continuous changes in this space such as
trafic and transportation on the temporal scale. In contrast other domains, such as ecology, are less
frequently investigated, since there are still large parts of the complex system or network unknown
making it dificult to model nodes and edges with high coverage and quality. Moreover, much of
Germany
      </p>
      <p>CEUR
Workshop</p>
      <p>
        ISSN1613-0073
the knowledge collected in ecosystem research remains unstructured in publications or is dificult to
access in researchers’ studies. A possible benefit of a STKG in ecology could be the linking of domain
knowledge and experimental data to support data integration and analysis e.g. for uncovering unknown
relationships, interactions or patterns. In this context, there is a significant need to develop new
methods and interdisciplinary approaches. The “AgriRestore” project, for instance, seeks to investigate
a deep understanding of key indicators for more resilient ecosystems and landscapes [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. To this
end, researchers from diferent disciplines (ecology, agriculture, data science) are working together to
investigate ecological relationships across various spatial and temporal scales.
      </p>
      <p>The origins of STKG trace back to early research in graph theory. Over time graph models have evolved
from simple graphs to semantically enriched knowledge graphs. Similarly, basic graph algorithms have
evolved into comprehensive deep learning architectures. Research on graphs and networks has been
conducted simultaneously and independently of each other in diferent domains such as mathematics,
computer science, physics, biology and geography. This resulted in a lack of standardization and
inconsistent terminology. A historical overview is helpful in order to understand the origins of STKG and
develop a holistic understanding for deeper insights. Examining contributions from various disciplines
fosters a comprehensive understanding of STKG and promotes interdisciplinary collaboration to improve
their development. The main contributions of the paper are:
• A brief outline of the origins of STKG, including knowledge, temporal and spatial graphs.
• A high-level overview of our approach and planned research on STKG in the domain of ecology.</p>
      <p>The remainder of this paper is organized as follows: Section 2 presents the origins of spatio-temporal
knowledge graphs. In Section 3 we introduce our approach for spatio-temporal knowledge graphs
within the project “AgriRestore”. Section 4 summarizes and concludes this work.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Origins of Spatio-Temporal Knowledge Graphs</title>
      <p>To gain a comprehensive understanding of the origins of spatio-temporal knowledge graphs, it is helpful
to look beyond individual contributions and consider the overall development of the field over time.
Table 1 presents a timeline highlighting years alongside selected publications and concepts introduced
during those periods. The timeline serves several purposes: it highlights important trends and changes
in the field, provides a condensed historical context and helps to develop a conceptual understanding of
how today’s modern approaches emerged. It also underlines the interdisciplinary nature of the field,
as spatio-temporal knowledge graphs are not only applied in diferent areas, but the basic research
has also been driven by several disciplines, including computer science, physics and geography. This
timeline is not intended to be exhaustive. Rather, it highlights selected milestones that we believe are
relevant for understanding the historical development of the field.</p>
      <p>
        Graph theory dates back to the 18th century, when Leonhard Euler published an answer to the
“Königsberg bridge problem” [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Two hundred years later, the research area gained broader interest
again. A starting point of modern graph theory was the idea of “random graphs”, a graph model where
edges are generated on a fixed set of nodes based on probabilistic processes [ 12]. At the same time,
fundamental algorithms were also proposed. These include, for instance, the “Dijkstra” algorithm [13],
a shortest path algorithm within weighted graphs that has also been adapted for temporal graphs [33]
and is still relevant for spatio-temporal knowledge graphs [34].
      </p>
      <p>
        1736s ⋯ ⋯• “Seven Bridges of Königsberg”, Euler [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]
1959s ⋯ ⋯• “Random Graphs”, Erdős and Rényi [12]
1959s ⋯ ⋯• “Shortest-Path” Algorithm, Dijkstra [13]
1969s ⋯ ⋯• Book “Network analysis in geography”, Haggett and Chorley [14]
1969s ⋯ ⋯• Network Database Model “CODASYL”, Bachman et al. [15]
1972s ⋯ ⋯• Foundational Book “Graph Theory”, Harary [16]
1978s ⋯ ⋯• Centrality Measures, Freeman [17]
1990s ⋯ ⋯• Considerations on Temporal Network Models
1993s ⋯ ⋯• Ontologies in Computer Science, Gruber [18]
1998s ⋯ ⋯• “PageRank” Algorithm, Page and Brin [19]
1998s ⋯ ⋯• “Small-World” Networks, Watts and Strogatz [20]
1999s ⋯ ⋯• Spatio-Temporal Graph Model, Renolen [21]
1999s ⋯ ⋯• “Scale-Free” Networks, Barabási [22]
1999s ⋯ ⋯• Draft RDF-Standard, Lassila and Swick a
2001s ⋯ ⋯• Introducing “Semantic Web”, Berners-Lee et al. [23]
2002s ⋯ ⋯• Community Detection, Girvan and Newman [24]
2002s ⋯ ⋯• Statistical Mechanics on Networks, Albert and Barabási [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
2009s ⋯ ⋯• Graph Neural Networks (GNN), Scarselli et al. [25]
2010s ⋯ ⋯• Property Graphs, Rodriguez and Neubauer [26]
2011s ⋯ ⋯• Survey Spatial Networks, Barthelemy [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]
2012s ⋯ ⋯• Cross-domain Survey on Temporal Networks, Holme and Saramäki [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]
2012s ⋯ ⋯• Introducing “Knowledge Graph” (KG), Googleb
      </p>
      <p>Revival of GNN by introducing Graph Convolutional Networks, Kipf
2016s ⋯ ⋯• and Welling [27]
2016s ⋯ ⋯• Survey on KG, Paulheim [28]
2017s ⋯ ⋯• Survey on KG Embeddings, Wang et al. [29]
2020s ⋯ ⋯• Survey on KG Completion, Chen et al. [30]
2023s ⋯ ⋯• Property Graph Queries added in SQL:2023 standardc
2024s ⋯ ⋯• Survey unification KG and LLM, Pan et al. [31]
2024s ⋯ ⋯• Survey Deep Learning on STKG, Zeghina et al. [32]
ahttps://www.w3.org/TR/1999/REC-rdf-syntax-19990222/, last visited: 10.09.2025
bhttps://blog.google/products/search/introducing-knowledge-graph-things-not/, last visited: 10.09.2025
chttps://www.iso.org/standard/79473.html, last visited: 10.09.2025</p>
      <p>Soon after, the first books on graph theory have been published, describing numerous basic graph
models and methods, including simple, weighted, labeled, directed and multigraphs. One of these
fundamental books is “Graph Theory” by Frank Harary [16]. At the time, graphs were also being used
to analyze geographical networks, reflected for instance in the book “Network analysis in geography”
by Haggett and Chorley [14].</p>
      <p>In 1969 the “Committee on Data Systems Languages” (CODASYL) developed the first network data
model, which enables the declaration of data structures in form of networks [15]. In 1976, CODASYL
published the corresponding network database model [35]. The relational data model was proposed
in 1970 [36]. During the 1970s the network data model and the relational model were in competition.
CODASYL’s model lost to the relational model due to the latter’s greater commercial adoption, still the
network data model was one of the earliest data models developed [37].</p>
      <p>In research, new algorithms continued to be investigated; overviews of these were published in the
1970s [17]. The “PageRank” centrality algorithm, which was used to rank websites, became very well
known around 1998 [19]. Community detection algorithms gained broad interest in the early 2000s,
with early approaches aiming to find communities using centrality-based criteria [ 24]. Both classes of
algorithms were adopted for temporal [38, 39] and spatial [40, 41] graphs and are under investigation
again in spatio-temporal knowledge graphs [42, 43].</p>
      <p>
        Until the 1990s, graph theory often focused on “random graphs”, this changed with the formulation
of “small-world” networks [20] and “scale-free” networks [22]. Both network models are based on the
assumption that real networks are often not the result of random processes. Small-world networks
consist of small groups that are connected by a few hops. Scale-free networks have a few nodes
with many edges and many nodes with few edges, i.e. the degree distribution follows the power-law.
First major review articles were published shortly afterwards, providing an overview of the numerous
network topologies, dynamics, metrics and analysis methods, e.g. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. At the same time, the first
conceptual models of spatio-temporal graphs were proposed, highlighting their advantages but lacking
practical implementation [21].
      </p>
      <p>In the 1990s, there was a shift towards enhancing graph-based technologies and the semantic
enrichment of data models. Two approaches that leverage graph structures to represent knowledge are
ontologies [18] and the Resource Description Framework (RDF). Ontologies provide a structured and
formal way to capture domain-specific knowledge and RDF ofers a flexible and generic model for
representing information on the web. RDF serves as a foundational technology of the Semantic Web
[23]. Both ontology-based and RDF-based knowledge representations have been extended to support
the integration of spatio-temporal data [44, 45].</p>
      <p>
        During the 1990s, graph models were developed to incorporate temporal aspects into their structure
and semantics. Previously, most examined graphs were static, i.e. changes over time at the nodes or
edges are not taken into account. Temporal graph models emerged rapidly and independently across
various domains. This led to a lack of standardization and consistent terminology. The topic received a
major boost with the first large overview articles, e.g. “temporal networks” from 2012 [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        Research relevant to spatio-temporal knowledge graphs also originates from geography and
geographic information systems (GIS) [46], beginning in the mid-20th century. Spatial graphs, i.e. the
nodes and edges are positioned in Euclidean space, experienced a revival of interest in the 2000s. The
2011 survey article titled “Spatial Networks” [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] provides a comprehensive overview of the field’s
developments.
      </p>
      <p>A commonly used graph model for representing spatio-temporal knowledge graphs is the “Property
Graph Model” (PGM). The PGM was examined in more detail in 2010 [26] and integrates several
developments in graph modeling into a unified framework, e.g. directed and multiple edges, labels and
attributes on nodes and edges. One of the key strengths of the Property Graph Model is its flexibility,
making it adaptable across various domains. Along with RDF graphs, it is widely supported by modern
graph databases [47].</p>
      <p>Since the 2010s, research on graph models and their applications across various domains has
significantly increased. Google established the term “Knowledge Graphs” (KG) in 2012. The first overview
articles were already published soon after [ 28]. Other developments that have significantly influenced
knowledge graphs include graph neural networks (GNNs), which were introduced in 2009 [25], but
gained popularity with a 2016 publication [27] and are currently a major topic within spatio-temporal
knowledge graphs [32]. Additionally, “knowledge graph embeddings” [29] aim to represent graphs
in a low-dimensional space, for applications like “Nearest-Neighbor” algorithms. “Knowledge Graph
Completion” [30] seeks to fill in missing information within a knowledge graph. Furthermore, the
integration of Large Language Models (LLMs) has been explored for both constructing knowledge
graphs and using knowledge graphs to support LLMs [31]. Moreover, the growing popularity of graph
databases and declarative querying of graph structures has led to the integration of Property Graph
Queries into the SQL:2023 standard.</p>
      <p>The timeline represents an intermediate result of our ongoing research aimed at gaining a
comprehensive overview of the origins and diverse contexts of spatio-temporal knowledge graphs.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Knowledge Graphs for Ecology</title>
      <p>This section relates our work on spatio-temporal knowledge graphs to the ecological context of the
“AgriRestore” project. Building on this, we summarize the core ideas of our research and outline
challenges we want to address.</p>
      <sec id="sec-3-1">
        <title>3.1. Ecological Background and Context</title>
        <p>Ecology is a domain that can benefit from detailed modeling of spatio-temporal knowledge graphs.
Within ecology there are many complex and dynamic relationships that impact ecosystems. Global
change significantly impacts biodiversity and ecosystem functionality in agricultural landscapes, driven
by multiple factors such as intensive land use. To counteract the impacts various ecosystem and
landscape restoration (ELR) measures were developed. However, there is still a lack of methods and
analyses for a deeper understanding of key indicators for the transition to more resilient ecosystems and
landscapes. The project “AgriRestore”1 (full title: “Ecosystem and landscape restoration across spatial
and temporal scales to enhance biodiversity and climate resilience in agricultural landscapes”) aims
to extend the knowledge in restoration science by assessing the efects of temporary and permanent
ELR measures in agricultural landscapes. To achieve this, the team of researchers conducts numerous
experiments and analyses to identify factors for success or failure of ELR measures at various locations,
with varying degrees of granularity (e.g. soil samples, remote sensing) and over diferent periods of
time to achieve a holistic understanding of ecological restoration.</p>
        <p>In this context, the suitability of spatio-temporal knowledge graphs, along with new methods for
their creation and analysis, needs to be investigated. Spatio-temporal knowledge graphs can help to
gain new insights through a comprehensive analysis of results from previous and new data collection.
The created graph is intended to be the backbone for data integration and analyses. In addition, it aims
to consolidate and assess landscape-level impacts, evaluate the generalizability of findings and identify
patterns related to ecosystem and landscape restoration. Ultimately, our goal is to develop a data-driven
approach that supports the creation of a knowledge-driven framework for ecosystem and landscape
restoration across spatial and temporal scales.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Approach for Spatio-Temporal Knowledge Graphs</title>
        <p>Figure 2 presents an overview of our approach to develop spatio-temporal knowledge graphs for complex
systems, with a particular focus on ecosystem research. In addition, we want to introduce knowledge
graph based analysis methods designed to uncover new insights, such as previously unknown patterns
or relationships relevant to ecosystem dynamics and restoration. We pursue a holistic approach to
avoid isolated consideration of individual components and to ensure compatibility and reproducibility.</p>
        <p>Figure 2 (1) illustrates the extraction of knowledge graphs from both structured and unstructured data.
Depending on the domain or use case, e.g. ecology, researchers often do not initially plan or work with
knowledge graphs but build their analyses on structured data like tables or on unstructured data like
written documents. Transforming these types of data into meaningful and broadly applicable graphs
presents a significant challenge [ 48]. This is made even more complex when dealing with expressive
models like spatio-temporal knowledge graphs. Moreover, the initial modeling of the knowledge graphs,
i.e. what is stored where and how, is challenging and should not be neglected, as it influences data
management and analysis in the long term. The resulting graph model of this process is influenced
by several factors, including the properties to be stored and the type of data, e.g. static, temporal,
spatial or spatio-temporal. Large Language Models (LLMs) promise a (semi-) automated knowledge
graph creation of data volumes on a large scale [31]. LLMs can be used to create a knowledge graph
from structured and unstructured data. However, these methods must be examined in terms of their
applicability and quality for diferent types of data and goals. Further challenges include the traceability
1https://agrirestore.de/, last visited: 10.09.2025
of information obtained from unstructured and structured data. While unstructured data might refer to
its origin, methods could be investigated that enable the reconstruction of the original structured data.</p>
        <p>Figure 2 (2) addresses the evaluation of knowledge graphs. Suitable evaluation methods for knowledge
graphs are a current challenge, i.e. methods that verify the validity of a created knowledge graph
[49]. The challenge remains for both small and large knowledge graphs, as well as for those manually
conceptualized, generated by LLMs or hybrid approaches. In certain applications of knowledge graphs,
e.g. ecological systems or chemistry [50], the inherent complexity of the data can hinder even experts
from efectively evaluating the entities and relationships within the graph. In these domains, a crucial
challenge is figuring out what evaluations criteria can be used and how to assess knowledge graphs
when the truth is not (yet) known. Even when the truth is not fully known, knowledge graphs can still
be valuable in these fields by advancing research areas. By providing a holistic view on the considered
objects and their relationships, they can help to derive new information and support the planning and
design of new experiments.</p>
        <p>Figure 2 (3) illustrates the analyses and prediction on top of spatio-temporal knowledge graphs. One
of the primary reasons for creating a knowledge graph is to leverage its structure to gain insights.
Thus, finding suitable analytical methods that yield meaningful and interpretable results is a significant
challenge. The range of methods available for graph analysis is already quite extensive, e.g. link
prediction [51], community detection [52] and centrality [53]. Future research could examine whether
existing analysis methods are expressive enough for spatio-temporal knowledge graphs or if entirely
new approaches are required. Predictive tasks are already showing increasingly promising results on
spatio-temporal knowledge graphs, making them a compelling area [32].</p>
        <p>Our approach within the “AgriRestore” project will comprise the transformation of structured and
unstructured data into a spatio-temporal knowledge graph. A suitable graph model is defined in
advance, which should be generalizable and transferable to other fields of application. Further, it is
crucial to develop evaluation methods and benchmark data sets for knowledge graphs created within
ecology. The methods should not only rely on expert knowledge but also be (semi-) automated and
capable of handling data where the truth is not yet known. The spatio-temporal knowledge graph
could serve as the initial point of contact for new data obtained from experiments conducted within the
project. The graph structure could also help in uncovering connections between data points that have
previously remained hidden. Further in-depth analyses could assist in evaluating the various impacts on
ecosystems and biodiversity. On a temporal scale, the knowledge graph could be used to trace previous
developments and predict future states. On a spatial scale, its applicability to other regions could be
evaluated.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>The paper shows that spatio-temporal knowledge graphs have their origins in an extensive body of
literature that has emerged over several decades of graph research. New publications are emerging on
a large scale, addressing current challenges and seeking to provide a better understanding of complex
systems in time and space. Previously established findings must be acknowledged to prevent the
redundant reinvention of existing concepts. There are numerous unresolved and new challenges
that need to be addressed. These challenges arise at various stages, starting with the construction of
spatio-temporal knowledge graphs and continuing through to their analysis.</p>
      <p>In future work, our goal is to adopt a holistic approach that considers all processes in the life cycle of
spatio-temporal knowledge graphs in an ecological context. The objective of this concept is to avoid
isolating individual components and to ensure compatibility and reproducibility. Furthermore, we
will elaborate on specific challenges of spatio-temporal knowledge graphs within ecosystem research,
highlighting, among other things, the possibilities and limitations of previous approaches and possible
directions for development.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Acknowledgments</title>
      <p>Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) Project-ID
528485254 - FIP 16.
[12] P. Erdős, A. Rényi, On random graphs i, Publ. math. debrecen 6 (1959) 18.
[13] E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1
(1959) 269–271. doi:10.1007/bf01386390.
[14] P. Haggett, R. J. Chorley, Network analysis in geography, number 1 in Explorations in spatial
structure, reprint. with corrections, first publ. as a paperback ed., Arnold, London, 1969.
[15] C. W. Bachman, R. E. Batchelor, I. M. Beriss, C. R. Blose, T. I. Burakreis, V. D. Valle, G. G. Dodd,
W. Helgeson, J. Lyon, A. T. Metaxides, G. E. McKinzie, P. Siegel, W. G. Simmons, L. L. Sturgess,
H. Tellier, S. B. Weinberg, G. T. Werner, Data base task group report to the CODASYL programming
language committee, October 1969, Association for Computing Machinery, New York, NY, USA,
1969.
[16] F. Harary, Graph Theory (on Demand Printing Of 02787), Taylor &amp; Francis Group, 2018. doi:10.</p>
      <p>1201/9780429493768.
[17] L. C. Freeman, Centrality in social networks conceptual clarification, Social Networks 1 (1978)
215–239. doi:10.1016/0378-8733(78)90021-7.
[18] T. R. Gruber, A translation approach to portable ontology specifications, Knowledge Acquisition 5
(1993) 199–220. doi:10.1006/knac.1993.1008.
[19] L. Page, The PageRank citation ranking: Bringing order to the web, Technical Report, Technical</p>
      <p>Report, 1999.
[20] D. J. Watts, S. H. Strogatz, Collective dynamics of ‘small-world’ networks, Nature 393 (1998)
440–442. doi:10.1038/30918.
[21] A. Renolen, Concepts and methods for modelling temporal and spatiotemporal information,
number 1999,79 in Doktor ingeniøravhandling, NTNU, Trondheim, 1999.
[22] A.-L. Barabási, R. Albert, Emergence of scaling in random networks, Science 286 (1999) 509–512.</p>
      <p>doi:10.1126/science.286.5439.509.
[23] T. Berners-Lee, J. Hendler, O. Lassila, The Semantic Web: A New Form of Web Content that is
Meaningful to Computers will Unleash a Revolution of New Possibilities, ACM, 2023, pp. 91–103.
doi:10.1145/3591366.3591376.
[24] M. Girvan, M. E. J. Newman, Community structure in social and biological networks, Proceedings
of the National Academy of Sciences 99 (2002) 7821–7826. doi:10.1073/pnas.122653799.
[25] F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, G. Monfardini, The graph neural network
model, IEEE Transactions on Neural Networks 20 (2009) 61–80. doi:10.1109/tnn.2008.2005605.
[26] M. A. Rodriguez, P. Neubauer, Constructions from dots and lines (2010). doi:10.48550/ARXIV.</p>
      <p>1006.2361.
[27] T. N. Kipf, M. Welling, Semi-supervised classification with graph convolutional networks, 2016.</p>
      <p>doi:10.48550/ARXIV.1609.02907.
[28] H. Paulheim, Knowledge graph refinement: A survey of approaches and evaluation methods,</p>
      <p>Semantic Web 8 (2016) 489–508. doi:10.3233/sw-160218.
[29] Q. Wang, Z. Mao, B. Wang, L. Guo, Knowledge graph embedding: A survey of approaches
and applications, IEEE Transactions on Knowledge and Data Engineering 29 (2017) 2724–2743.
doi:10.1109/tkde.2017.2754499.
[30] Z. Chen, Y. Wang, B. Zhao, J. Cheng, X. Zhao, Z. Duan, Knowledge graph completion: A review,</p>
      <p>IEEE Access 8 (2020) 192435–192456. doi:10.1109/access.2020.3030076.
[31] S. Pan, L. Luo, Y. Wang, C. Chen, J. Wang, X. Wu, Unifying large language models and knowledge
graphs: A roadmap, IEEE Transactions on Knowledge and Data Engineering 36 (2024) 3580–3599.
doi:10.1109/tkde.2024.3352100.
[32] A. Zeghina, A. Leborgne, F. Le Ber, A. Vacavant, Deep learning on spatiotemporal graphs: A
systematic review, methodological landscape, and research opportunities, Neurocomputing 594
(2024) 127861. doi:10.1016/j.neucom.2024.127861.
[33] W. Huo, V. J. Tsotras, Eficient temporal shortest path queries on evolving social graphs, in:
Proceedings of the 26th International Conference on Scientific and Statistical Database Management,
SSDBM ’14, ACM, 2014. doi:10.1145/2618243.2618282.
[34] V. M. V. Gunturi, S. Shekhar, Spatio-Temporal Graph Data Analytics, Springer International</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Albert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.-L.</given-names>
            <surname>Barabási</surname>
          </string-name>
          ,
          <article-title>Statistical mechanics of complex networks</article-title>
          ,
          <source>Reviews of Modern Physics</source>
          <volume>74</volume>
          (
          <year>2002</year>
          )
          <fpage>47</fpage>
          -
          <lpage>97</lpage>
          . doi:
          <volume>10</volume>
          .1103/revmodphys.74.47.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>V. K.</given-names>
            <surname>Chaudhri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Baru</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Chittar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. L.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Genesereth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hendler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kalyanpur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. B.</given-names>
            <surname>Lenat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sequeda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Vrandečić</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Knowledge graphs: Introduction, history, and perspectives</article-title>
          ,
          <source>AI</source>
          Magazine
          <volume>43</volume>
          (
          <year>2022</year>
          )
          <fpage>17</fpage>
          -
          <lpage>29</lpage>
          . doi:
          <volume>10</volume>
          .1002/aaai.12033.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pan</surname>
          </string-name>
          , E. Cambria,
          <string-name>
            <given-names>P.</given-names>
            <surname>Marttinen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. S.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <article-title>A survey on knowledge graphs: Representation, acquisition, and applications</article-title>
          ,
          <source>IEEE Transactions on Neural Networks and Learning Systems</source>
          <volume>33</volume>
          (
          <year>2022</year>
          )
          <fpage>494</fpage>
          -
          <lpage>514</lpage>
          . doi:
          <volume>10</volume>
          .1109/tnnls.
          <year>2021</year>
          .
          <volume>3070843</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Barthélemy</surname>
          </string-name>
          , Spatial networks,
          <source>Physics Reports</source>
          <volume>499</volume>
          (
          <year>2011</year>
          )
          <fpage>1</fpage>
          -
          <lpage>101</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.physrep.
          <year>2010</year>
          .
          <volume>11</volume>
          .002.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>P.</given-names>
            <surname>Holme</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Saramäki</surname>
          </string-name>
          ,
          <article-title>Temporal networks</article-title>
          ,
          <source>Physics Reports</source>
          <volume>519</volume>
          (
          <year>2012</year>
          )
          <fpage>97</fpage>
          -
          <lpage>125</lpage>
          . doi:
          <volume>10</volume>
          .1016/j. physrep.
          <year>2012</year>
          .
          <volume>03</volume>
          .001.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Ali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zakarya</surname>
          </string-name>
          ,
          <article-title>Exploiting dynamic spatio-temporal graph convolutional neural networks for citywide trafic flows prediction</article-title>
          ,
          <source>Neural Networks</source>
          <volume>145</volume>
          (
          <year>2022</year>
          )
          <fpage>233</fpage>
          -
          <lpage>247</lpage>
          . doi:
          <volume>10</volume>
          .1016/ j.neunet.
          <year>2021</year>
          .
          <volume>10</volume>
          .021.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kapoor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Ben</surname>
          </string-name>
          , L. Liu,
          <string-name>
            <given-names>B.</given-names>
            <surname>Perozzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Barnes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Blais</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          <article-title>O'Banion, Examining covid-19 forecasting using spatio-temporal graph neural networks</article-title>
          ,
          <year>2020</year>
          . doi:
          <volume>10</volume>
          .48550/ARXIV.
          <year>2007</year>
          .
          <volume>03113</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>X.</given-names>
            <surname>Ge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Peng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , J. Chen,
          <article-title>Spatio-temporal knowledge graph based forest fire prediction with multi source heterogeneous data</article-title>
          ,
          <source>Remote Sensing</source>
          <volume>14</volume>
          (
          <year>2022</year>
          )
          <article-title>3496</article-title>
          . doi:
          <volume>10</volume>
          .3390/rs14143496.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>G.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Shao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Y. Zheng,
          <article-title>Spatio-temporal graph neural networks for predictive learning in urban computing: A survey, IEEE Transactions on Knowledge and Data Engineering (</article-title>
          <year>2024</year>
          )
          <fpage>1</fpage>
          -
          <lpage>20</lpage>
          . doi:
          <volume>10</volume>
          .1109/tkde.
          <year>2023</year>
          .
          <volume>3333824</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>C.</given-names>
            <surname>Fischer</surname>
          </string-name>
          , g. jörg, A.
          <string-name>
            <surname>Groß</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Kirmer</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          <string-name>
            <surname>Knauer</surname>
            , M. Meyer, M. Pause,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Rozhon</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Tischew</surname>
          </string-name>
          ,
          <article-title>Agrirestore: Ecosystem and landscape restoration across spatial and temporal scales to enhance biodiversity and climate resilience in agricultural landscapes</article-title>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>L.</given-names>
            <surname>Euler</surname>
          </string-name>
          ,
          <article-title>Solutio problematis ad geometriam situs pertinentis</article-title>
          ,
          <source>Commentarii academiae scientiarum Petropolitanae</source>
          (
          <volume>1741</volume>
          )
          <fpage>128</fpage>
          -
          <lpage>140</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>