Pith. sign in

REVIEW 4 major objections 5 minor 1 cited by

Understanding Graph Databases: A Comprehensive Tutorial and Survey

T0 review · 4 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This tutorial claims that graph databases are specialized systems for complex, interconnected data and offers a comprehensive guide from graph theory through practical implementation in NetworkX and Neo4j.

desk verdict Tutorial with no new research content whose worked examples are several demonstrably wrong; usable only after every listing is run and corrected. read the letter →

arxiv 2411.09999 v1 pith:A56TGV7P submitted 2024-11-15 cs.DB cs.PL

Sydney Anuyah , Victor Bolade , Oluwatosin Agbaakin This is my paper · ORCID
classification cs.DBcs.PL
keywords graphdatabasesNeo4jNetworkXtheoryCypherqueriescommunitydetectioncentralitymeasuresvisualization
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper sets out to establish that graph databases have emerged as specialized systems for handling complex, interconnected data, and that a single tutorial can guide a reader from the basics of graph theory through practical database operations. It positions graph databases against relational databases, arguing that the node-and-edge model removes costly joins and naturally supports traversal-heavy analytics. The bulk of the paper is a hands-on walkthrough: creating and visualizing graphs in NetworkX and Neo4j, running Dijkstra's shortest path, computing centrality measures and PageRank, detecting communities with Louvain, and building small graph-based applications. If the tutorial's instructions and outputs are accurate, it gives a new entrant a usable path into the field.

What carries the argument

The teaching engine is the property graph model: nodes (entities) and edges (relationships) that hold key-value attributes, queried either imperatively in Python via NetworkX or declaratively via Cypher in Neo4j. This model carries the argument because every major concept, including degree, path length, connected components, centrality, PageRank, and community detection, is defined on it and then demonstrated as a short code listing.

What would settle it

Run the NetworkX code of Listing 23 on the graph with edges (1,2), (2,3), (4,5) and check that connected_components returns two sets, {1,2,3} and {4,5}, not the single list printed in the paper; likewise compute closeness centrality for the five-node cycle in Listing 40 and confirm that node 3's value is not 1.00. Either mismatch would refute the tutorial's claim that its expected outputs are trustworthy.

Watch

Extended reading notes

Core claim

The central claim the authors are establishing is that the property graph model, where nodes and edges carry attributes, provides a unified and pedagogically tractable way to represent and query interconnected data, and that mainstream tools (NetworkX for programming, Neo4j with Cypher for a database) cover the full workflow. The paper's own contribution is the synthesis: a single narrative that goes from graph definitions, through algorithms such as Dijkstra and centrality measures, to implementation and deployment in real-world applications.

Load-bearing premise

The tutorial's usefulness depends on the correctness of its code listings and printed outputs; if a reader runs the examples and gets different results, the guide fails as a reliable learning resource.

Editorial extensions

If this is right

  • A reader who follows the tutorial can construct and query a property graph in both NetworkX and Neo4j.
  • The comparison to relational databases positions graph databases as the preferred choice when multi-level relationship traversal dominates the workload.
  • The algorithm coverage allows a newcomer to compute shortest paths, centrality, and community structure with standard libraries.
  • The case studies (social network, recommender, fraud detection) show the same graph operations transferring across domains.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The tutorial could be used as a course module outline, with each section mapping to a lab exercise.
  • The breadth of coverage suggests graph database education is converging on a standard toolchain of Python and Neo4j, which shapes how practitioners are trained.
  • Readers following the code listings should verify outputs against the actual libraries, since a tutorial of this kind is only as reliable as its examples.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. This paper is a tutorial and survey on graph databases, covering introductory graph theory, graph database systems (Neo4j, Amazon Neptune, ArangoDB), practical operations in NetworkX and Neo4j/Cypher, visualization techniques, advanced algorithms such as Dijkstra, centrality measures, PageRank, community detection, large-graph optimization, and applications. The stated goal is to serve as a comprehensive, practical guide for researchers and practitioners entering the field.

Significance. If accurate, the tutorial would be a useful one-stop pedagogical resource: it brings together a broad set of topics, provides concrete code listings in two widely used systems, and grounds the discussion in a substantial bibliography. The paper also makes machine-checkable claims through its printed outputs, which is a strength because the correctness of a tutorial can be verified directly. However, the tutorial's central value depends entirely on the reliability of these worked examples, and several are demonstrably wrong. The paper therefore cannot currently serve as the dependable guide it claims to be, although the identified errors are local and correctable.

major comments (4)
  1. [Section III.C, Listing 23] The printed 'Connected Components: [1, 2, 3, 4, 5]' is incorrect for the graph G = nx.Graph([(1, 2), (2, 3), (4, 5)]) defined in the listing. That graph has two disconnected components, {1, 2, 3} and {4, 5}, and Figure 8 on the same page states exactly this. The output should be a list of two sets (e.g., [{1, 2, 3}, {4, 5}]). Since the example is meant to teach connected components, this error is load-bearing for the tutorial's reliability.
  2. [Section VI.B.2, Listing 40] The claimed closeness centrality output for a five-node cycle graph, '1: 0.67, 2: 0.80, 3: 1.00, 4: 0.80, 5: 0.67', cannot be correct. All nodes of a cycle C5 are symmetric, so their closeness centrality values must be equal; moreover, a value of 1.00 would require the node to be adjacent to all other four nodes, which is not true. NetworkX returns 0.667 for every node. This incorrect output undermines the centrality example.
  3. [Section VI.C.1, Listing 41] The reported PageRank scores [0.29, 0.34, 0.26, 0.11] do not satisfy the PageRank formula stated in the same section. For node 1, the equation gives PR(1) = 0.15/4 + 0.85 * PR(3)/2; with PR(3) = 0.26 this is 0.148, not 0.29. Solving the system for the displayed directed graph yields approximately [0.174, 0.333, 0.320, 0.174], which is also what NetworkX computes. The example thus contradicts the paper's own definition and the actual library output.
  4. [Section IV.C.3, Listing 31] The expected output for nx.difference omits node 2 from the difference graph, but node 2 is present in G1 and is not deleted by the difference operation, so it must appear in the node list. The listed edges [(1, 2), (3, 4)] are also inconsistent with the listed nodes, since edge (1, 2) requires node 2. The correct output should include nodes [1, 2, 3, 4] in some order.
minor comments (5)
  1. [Section III.B.2, Listing 21] The heading before Listing 21 says 'Retrieving Edges using Neo4j from Python', but the listing actually computes Dijkstra's shortest path; the heading should be corrected.
  2. [Section I.A] There are numerous typographical errors, e.g., 'grpah' and 'ususally' in Section I.A.1; the text needs a careful proofreading pass.
  3. [Listings 7 and 9] The printed output for node and edge attributes is missing the surrounding braces of the dictionary, e.g., 'The attributes for the node Bob are: ’age’: 25...' should be presented as a dictionary literal such as {'age': 25, 'city': 'Los Angeles'}.
  4. [Throughout] Several listings have 'Output message' or 'Expected Output' lines placed inside the code listings without clear visual separation, making it easy for readers to mistake printed output for code.
  5. [References] Reference [2] appears to be unrelated to the topic discussed at the point where it is cited; please verify the relevance of all references.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the paper is a survey/tutorial whose content is external knowledge; the only self-citations are minor and not load-bearing.

full rationale

This paper is a tutorial and survey, not a derivation-driven research paper. Its central claim is pedagogical: it explains graph theory, graph database systems, and coding examples using NetworkX and Neo4j. The claimed derivation chain, to the extent one exists, consists of restating standard definitions (e.g., Dijkstra's algorithm, closeness centrality, PageRank) and library outputs. None of these results is derived from a fitted parameter, and none of the presented outputs is used as input to a subsequent claim. The references to Anuyah and colleagues ([9] and [68]) appear in general survey contexts, such as mentioning GNNs for social networks or benefits of graph databases; they do not justify any of the paper's central tutorial content, so they are not load-bearing. The non-reproducible sample outputs in Listings 23, 40, and 41 are correctness defects in a tutorial artifact, but they are not circular: the printed values are presented as expected outputs rather than as fitted inputs that later predict those same values. Since no equation or definition in the paper reduces to its own conclusion, and the tutorial is checkable against external library behavior, the appropriate finding is no significant circularity, with a small allowance for the presence of non-load-bearing self-citations.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

There are no fitted parameters or invented entities. The background axioms are textbook definitions and cited performance claims. The key unstated assumption that the code outputs are correct is violated in several places.

assumptions (3)
  • standard math Standard graph theory definitions: node, edge, degree, path, adjacency matrix, and density formula D=2m/(n(n-1)).
    Used throughout Sections I and III as background for the tutorial; taken as given from the literature.
  • domain assumption Dijkstra's algorithm, Louvain method, centrality measures, and PageRank behave as described and their NetworkX and Neo4j implementations return the printed values.
    The tutorial presents these as fact, but multiple expected outputs are wrong (Listings 23, 40, and 41).
  • domain assumption Graph databases such as Neo4j, Amazon Neptune, and ArangoDB provide efficiency advantages over relational databases for relationship-heavy workloads.
    Repeated claim in Sections I.C and VIII, supported only by citations rather than new benchmarks.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Understanding Graph Databases: A Comprehensive Tutorial and Survey." pith.science (2026). https://pith.science/paper/A56TGV7P

@misc{pith2026241109999,
  author       = {Pith},
  title        = {Pith review of: Understanding Graph Databases: A Comprehensive Tutorial and Survey},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/A56TGV7P}},
  note         = {Machine review of arXiv:2411.09999}
}
read the original abstract

This tutorial serves as a comprehensive guide for understanding graph databases, focusing on the fundamentals of graph theory while showcasing practical applications across various fields. It starts by introducing foundational concepts and delves into the structure of graphs through nodes and edges, covering different types such as undirected, directed, weighted, and unweighted graphs. Key graph properties, terminologies, and essential algorithms for network analysis are outlined, including Dijkstras shortest path algorithm and methods for calculating node centrality and graph connectivity. The tutorial highlights the advantages of graph databases over traditional relational databases, particularly in efficiently managing complex, interconnected data. It examines leading graph database systems such as Neo4j, Amazon Neptune, and ArangoDB, emphasizing their unique features for handling large datasets. Practical instructions on graph operations using NetworkX and Neo4j are provided, covering node and edge creation, attribute assignment, and advanced queries with Cypher. Additionally, the tutorial explores common graph visualization techniques using tools like Plotly and Neo4j Bloom, which enhance the interpretation and usability of graph data. It also delves into community detection algorithms, including the Louvain method, which facilitates clustering in large networks. Finally, the paper concludes with recommendations for researchers interested in exploring the vast potential of graph technologies.

Figures

Figures reproduced from arXiv: 2411.09999 by the authors.

Figure 1
Figure 1. Neo4j visualization of nodes and edges Edges Edges in the graph: [(’Alice’, ’Bob’), (’Alice’, ’Char￾lie’), (’Bob’, ’David’), (’Charlie’, ’Eve’)] The resulting graph visualization is shown in [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Graph visualization of edges created in Python with NetworkX [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Graph visualization of nodes with attributes in NetworkX [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figures from the paper (12 more)
Figure 4
Figure 4. Figure 4: Graph visualization of edges with attributes in NetworkX In Neo4j, attributes (called properties in Neo4j) are assigned using Cypher when creating nodes and relationships. CREATE (a:Person {name: ’Alice’, age: 30, city : ’New York’}) Listing 10. Assigning Attributes to…
Figure 6
Figure 6. Figure 6: Relationships created in Neo4j 2) Scenario: The social network consists of five individu￾als: Alice, Bob, Charlie, David, and Eve. Each person lives in a different city and has varying ages. Friendships are represented by edges, each with a unique closeness level. This…
Figure 7
Figure 7. Figure 7: Visualization of the Simple Social Network Graph [PITH_FULL_IMAGE:figures/full_fig_p009_7.png]
Figure 8
Figure 8. Figure 8: Graph Showing Two Connected Components: {1, 2, 3} and {4, 5} 4) Advanced Connectivity Techniques: Recent research ex￾plores extended connectivity properties like algebraic connec￾tivity, calculated from the second-smallest eigenvalue of the graph Laplacian matrix, prov…
Figure 10
Figure 10. Figure 10: Graph Visualization Before Edge Deletion [PITH_FULL_IMAGE:figures/full_fig_p012_10.png]
Figure 11
Figure 11. Figure 11: Graph Visualization After Edge Deletion (Node A to Node B [PITH_FULL_IMAGE:figures/full_fig_p012_11.png]
Figure 13
Figure 13. Figure 13: Spectral Layout of a Sample Graph Spectral layouts can reveal underlying clusters or groupings within complex networks, making them valuable for analyzing community structures in social networks or functional modules in biological networks. Spectral properties effecti…
Figure 12
Figure 12. Figure 12: Circular Layout of a 10-Node Cycle Graph [PITH_FULL_IMAGE:figures/full_fig_p016_12.png]
Figure 14
Figure 14. Figure 14: Spring Layout of a Sample Graph • Spectral Layouts reveal clusters and assist in network segmentation, valuable for community or cluster visual￾ization. • Spring Layouts provide a balance between readability and spatial organization, ideal for undirected, unstruc￾ture…
Figure 15
Figure 15. Figure 15: Graph with Labeled Nodes and Edges Here, node labels are automatically placed based on node positions, and custom edge labels are defined for clarity. Studies on text aesthetics highlight that font choices and label placements significantly impact readability. A study…
Figure 16
Figure 16. Figure 16: Graph with Custom Legend This custom legend explains node colors, guiding viewers in interpreting categories or clusters. Proper legend placement and clarity are essential for readability. [82] emphasizes that a well-positioned, concise legend helps users interpret co…
Figure 17
Figure 17. Figure 17: Louvain Community Detection in a NetworkX Graph [PITH_FULL_IMAGE:figures/full_fig_p019_17.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Advancing clinical trial outcomes using deep learning and predictive modelling: bridging precision medicine and patient-centered care

    cs.LG 2024-12 reject novelty 1.0 of 10

    This paper is a narrative review asserting that CNN, RNN, and transformer models can improve clinical trial recruitment, monitoring, and personalized medicine, but it reports no verifiable experiments, data, or code.

Reference graph

Works this paper leans on

144 extracted references · 72 canonical work pages · cited by 1 Pith paper

  1. [1]

    Towards enhancing the robustness of scale-free iot networks by an intelligent rewiring mechanism

    Syed Minhal Abbas, Nadeem Javaid, Ahmad Taher Azar, Umar Qasim, Zahoor Ali Khan, and Sheraz Aslam. Towards enhancing the robustness of scale-free iot networks by an intelligent rewiring mechanism. Sensors, 22(7):2658, 2022

    2022

  2. [2]

    Iot based recent trends in engineering and its applications

    Atul Agnihotri, Maalti Puri, and Amit Mahajan. Iot based recent trends in engineering and its applications. 2024

    2024

  3. [3]

    Catalytic and binding sites prediction in globular proteins through discrete markov chains and network centrality measures

    Gabriel E Aguilar-Pineda and L Olivares-Quiroz. Catalytic and binding sites prediction in globular proteins through discrete markov chains and network centrality measures. Physical Biology, 18(6):066002, 2021

    2021

  4. [4]

    Distance measures for embedded graphs

    Hugo A Akitaya, Maike Buchin, Bernhard Kilgus, Stef Sijben, and Carola Wenk. Distance measures for embedded graphs. Computational Geometry, 95:101743, 2021

    2021

  5. [5]

    Ganie, and Yilun Shang

    Abdollah Alhevaz, Maryam Baghipur, Hilal A. Ganie, and Yilun Shang. The generalized distance spectrum of the join of graphs. Symmetry, 12(1):169, 2020

    2020

  6. [6]

    On identifying the critical nodes and vulnerable edges for increasing network security

    Mohamed Alshaer and Paul Cotae. On identifying the critical nodes and vulnerable edges for increasing network security. 2018

    2018

  7. [7]

    Reciprocal degree distance and graph properties

    Mingqiang An, Yinan Zhang, Kinkar Ch Das, and Liming Xiong. Reciprocal degree distance and graph properties. Discrete Applied Mathematics, 258:1–7, 2019

    2019

  8. [8]

    Mapping rdf databases to property graph databases

    Renzo Angles, Harsh Thakkar, and Dominik Tomaszuk. Mapping rdf databases to property graph databases. IEEE Access, 8:86091–86110, 2020

    2020

Show all 144 references
  1. [9]

    Sydney Anuyah and Sunandan Chakraborty. Can deep learning large language models be used to unravel knowledge graph creation? In Proceedings of the International Conference on Computing, Machine Learning and Data Science , pages 1–6, 2024

    2024

  2. [10]

    Empirical evaluation of a cloud-based graph database: the case of neptune

    Ghislain Auguste Atemezing. Empirical evaluation of a cloud-based graph database: the case of neptune. In Knowledge Graphs and Seman- tic Web: Third Iberoamerican Conference and Second Indo-American Conference, KGSWC 2021, Kingsville, Texas, USA, November 22–24, 2021, Proceedi...

    2021

  3. [11]

    Species environmental niche distribution modeling for panthera tigris tigris ‘royal bengal tiger’using machine learning

    Shaurya Bajaj and D Geraldine Bessie Amali. Species environmental niche distribution modeling for panthera tigris tigris ‘royal bengal tiger’using machine learning. In Emerging Research in Computing, Information, Communication and Applications: ERCICA 2018, Volume 1, pages 251...

    2018

  4. [12]

    Assessing the computational limits of graphdbs’ engines-a comparison study between neo4j and apache spark

    Ioannis Ballas, Vassilios Tsakanikas, Evaggelos Pefanis, and Vassilios Tampakas. Assessing the computational limits of graphdbs’ engines-a comparison study between neo4j and apache spark. In Proceedings of the 24th Pan-Hellenic Conference on Informatics , pages 428–433, 2020

    2020

  5. [13]

    Term-graph anti-unification

    Alexander Baumgartner, Temur Kutsia, Jordi Levy, and Mateu Villaret. Term-graph anti-unification. 2018

    2018

  6. [14]

    Analysis of native multi-model database using arangodb

    Rajat Belgundi, Yash Kulkarni, and Balaso Jagdale. Analysis of native multi-model database using arangodb. In Proceedings of Third International Conference on Sustainable Expert Systems: ICSES 2022 , pages 923–935. Springer, 2023

    2022

  7. [15]

    Data fusion and graph analysis in fraud transaction detection: walkthrough of a case study

    Valerio Bellandi and Stefano Siccardi. Data fusion and graph analysis in fraud transaction detection: walkthrough of a case study. In 2022 IEEE International Conference on Big Data (Big Data) , pages 4601–

    2022

  8. [16]

    Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries

    Maciej Besta, Robert Gerstenberger, Emanuel Peter, Marc Fischer, Michał Podstawski, Claude Barthels, Gustavo Alonso, and Torsten Hoefler. Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries. ACM Computing Surveys, 56(2):1...

    2023

  9. [17]

    Deep learning with graph convolutional networks: An overview and latest applications in computational intelligence

    Uzair Aslam Bhatti, Hao Tang, Guilu Wu, Shah Marjan, and Aamir Hussain. Deep learning with graph convolutional networks: An overview and latest applications in computational intelligence. Inter- national Journal of Intelligent Systems , 2023(1):8342104, 2023

    2023

  10. [18]

    Hybrid par- allel implementation of multiple sequence alignment software clustalw on intel xeon phi

    Plamenka Borovska, Veska Gancheva, and Ivailo Georgiev. Hybrid par- allel implementation of multiple sequence alignment software clustalw on intel xeon phi. In Sixth International Conference on Advances in Computing, Electronics and Communication-ACEC 2017, Rome, Italy, 9-10 D...

    2017

  11. [19]

    The influence of color, color as influence: structuring tools for the design of a graphic design project

    Marine Boucher. The influence of color, color as influence: structuring tools for the design of a graphic design project

  12. [20]

    Algorithm for solving multicriteria problem of appointments on the networks

    Yu V Bugaeev, OV Avseeva, LA Korobova, and I Yu Shurupova. Algorithm for solving multicriteria problem of appointments on the networks. Proceedings of the Voronezh State University of Engineering Technologies, 79(4):71–74, 2017

    2017

  13. [21]

    Inductive link prediction banking fraud detection system using homogeneous graph-based ma- chine learning model

    Hilmi Aziz Bukhori and Rinaldi Munir. Inductive link prediction banking fraud detection system using homogeneous graph-based ma- chine learning model. In 2023 IEEE 13th Annual Computing and Communication Workshop and Conference (CCWC), pages 0246–0251. IEEE, 2023

    2023

  14. [22]

    A comprehensive survey of graph embedding: Problems, techniques, and applications

    Hongyun Cai, Vincent W Zheng, and Kevin Chen-Chuan Chang. A comprehensive survey of graph embedding: Problems, techniques, and applications. IEEE transactions on knowledge and data engineering , 30(9):1616–1637, 2018

    2018

  15. [23]

    Combinatorial optimization and reasoning with graph neural networks

    Quentin Cappart, Didier Ch ´etelat, Elias B Khalil, Andrea Lodi, Christo- pher Morris, and Petar Veli ˇckovi´c. Combinatorial optimization and reasoning with graph neural networks. Journal of Machine Learning Research, 24(130):1–61, 2023

    2023

  16. [24]

    Efficiency comparison of pathfinding algorithms a* and dijkstra’s in two dimensional grid

    Intars ˇCeslis and Sergejs Kodors. Efficiency comparison of pathfinding algorithms a* and dijkstra’s in two dimensional grid. In HUMAN. ENVIRONMENT. TECHNOLOGIES. Proceedings of the Students Inter- national Scientific and Practical Conference, number 24, pages 36–39, 2020

    2020

  17. [25]

    Multi-view attribute graph convolution networks for clustering

    Jiafeng Cheng, Qianqian Wang, Zhiqiang Tao, Deyan Xie, and Quanxue Gao. Multi-view attribute graph convolution networks for clustering. In Proceedings of the twenty-ninth international conference on international joint conferences on artificial intelligence , pages 2973–2979, 2021

    2021

  18. [26]

    Graphrc: Accelerating graph processing on dual-addressing memory with vertex merging

    Wei Cheng, Chun-Feng Wu, Yuan-Hao Chang, and Ing-Chao Lin. Graphrc: Accelerating graph processing on dual-addressing memory with vertex merging. In Proceedings of the 41st IEEE/ACM Interna- tional Conference on Computer-Aided Design , pages 1–9, 2022

    2022

  19. [27]

    Applications of link prediction in social networks: A review

    Nur Nasuha Daud, Siti Hafizah Ab Hamid, Muntadher Saadoon, Firdaus Sahran, and Nor Badrul Anuar. Applications of link prediction in social networks: A review. Journal of Network and Computer Applications, 166:102716, 2020

    2020

  20. [28]

    Temporal pattern recognition in graph data structures

    Pietro Daverio, Hassan Nazeer Chaudhry, Alessandro Margara, and Matteo Rossi. Temporal pattern recognition in graph data structures. In 2021 IEEE International conference on big data (Big Data) , pages 2753–2763. IEEE, 2021

    2021

  21. [29]

    Efficient vector influence clustering coefficient based directed community detection method

    Xiaolong Deng, Jiayu Zhai, Tiejun Lv, and Luanyu Yin. Efficient vector influence clustering coefficient based directed community detection method. IEEE Access, 5:17106–17116, 2017

    2017

  22. [30]

    Review paper oncom- plexity reduction in relational database using neo4j graph database

    TP Deshmukh, BR Bamnote, and SW Ahmad. Review paper oncom- plexity reduction in relational database using neo4j graph database

  23. [31]

    Query-based performance comparison of graph database and relational database

    Thi-Thu-Trang Do, Thai-Bao Mai-Hoang, Van-Quyet Nguyen, and Quyet-Thang Huynh. Query-based performance comparison of graph database and relational database. In Proceedings of the 11th Inter- national Symposium on Information and Communication Technology , pages 375–381, 2022

    2022

  24. [32]

    Thanou, M

    Xiaowen Dong, D. Thanou, M. Rabbat, and P. Frossard. Learning graphs from data: A signal representation perspective. IEEE Signal Processing Magazine, 2018

    2018

  25. [33]

    On the rank of the distance matrix of graphs

    Ezequiel Dratman, Luciano N Grippo, Ver ´onica Moyano, and Adri ´an Pastine. On the rank of the distance matrix of graphs. Applied Mathematics and Computation , 433:127394, 2022

    2022

  26. [34]

    On node features for graph neural networks

    Chi Thang Duong, Thanh Dat Hoang, Ha The Hien Dang, Quoc Viet Hung Nguyen, and Karl Aberer. On node features for graph neural networks. arXiv preprint arXiv:1911.08795 , 2019

    1911 arXiv

  27. [35]

    A methodological eval- uation of natural user interfaces for immersive 3d graph explorations

    Ugo Erra, Delfina Malandrino, and Luca Pepe. A methodological eval- uation of natural user interfaces for immersive 3d graph explorations. Journal of Visual Languages & Computing , 44:13–27, 2018

    2018

  28. [36]

    Reactome graph database: Efficient access to complex pathway data

    Antonio Fabregat, Florian Korninger, Guilherme Viteri, Konstantinos Sidiropoulos, Pablo Marin-Garcia, Peipei Ping, Guanming Wu, Lincoln Stein, Peter D’eustachio, and Henning Hermjakob. Reactome graph database: Efficient access to complex pathway data. PLoS computa- tional biol...

    2018

  29. [37]

    Graph theory in paediatric epilepsy: a systematic review

    Raffaele Falsaperla, Giovanna Vitaliti, Simona Domenica Marino, Andrea Domenico Pratic `o, Janette Mailo, Michela Spatuzza, Maria Roberta Cilio, Rosario Foti, and Martino Ruggieri. Graph theory in paediatric epilepsy: a systematic review. Dialogues in Clinical Neuroscience, 23...

    2021

  30. [38]

    Graphscope: a unified engine for big graph processing

    Wenfei Fan, Tao He, Longbin Lai, Xue Li, Yong Li, Zhao Li, Zhengping Qian, Chao Tian, Lei Wang, Jingbo Xu, et al. Graphscope: a unified engine for big graph processing. Proceedings of the VLDB Endowment, 14(12):2879–2892, 2021

    2021

  31. [39]

    Detection of influential nodes using social networks analysis based on network metrics

    Aftab Farooq, Gulraiz Javaid Joyia, Muhammad Uzair, and Usman Akram. Detection of influential nodes using social networks analysis based on network metrics. In 2018 international conference on computing, mathematics and engineering technologies (icomet) , pages 1–6. IEEE, 2018

    2018

  32. [40]

    Graph neural networks for recommender system

    Chen Gao, Xiang Wang, Xiangnan He, and Yong Li. Graph neural networks for recommender system. In Proceedings of the fifteenth ACM international conference on web search and data mining , pages 1623–1625, 2022

    2022

  33. [41]

    Graph- nas: Graph neural architecture search with reinforcement learning

    Yang Gao, Hong Yang, Peng Zhang, Chuan Zhou, and Yue Hu. Graph- nas: Graph neural architecture search with reinforcement learning. arXiv preprint arXiv:1904.09981 , 2019

    1904 arXiv

  34. [42]

    Incre- mental strong connectivity and 2-connectivity in directed graphs

    Loukas Georgiadis, Giuseppe F Italiano, and Nikos Parotsidis. Incre- mental strong connectivity and 2-connectivity in directed graphs. In Latin American Symposium on Theoretical Informatics, pages 529–543. Springer, 2018

    2018

  35. [43]

    Graph similarity based on matrix norms

    Timo Gervens and Martin Grohe. Graph similarity based on matrix norms. arXiv preprint arXiv:2207.00090 , 2022

    2022 arXiv

  36. [44]

    Neural message passing for quantum chemistry

    Justin Gilmer, Samuel S Schoenholz, Patrick F Riley, Oriol Vinyals, and George E Dahl. Neural message passing for quantum chemistry. In International conference on machine learning , pages 1263–1272. PMLR, 2017

    2017

  37. [45]

    b embedding vertex intrinsic relevance in network analysis: the case of betweenness

    Orazio Giustolisi, Luca Ridolfi, and Antonietta Simone. b embedding vertex intrinsic relevance in network analysis: the case of betweenness. CoRR, 2019

    2019

  38. [46]

    Challenges with graph interpretation: A review of the literature

    Nirit Glazer. Challenges with graph interpretation: A review of the literature. Studies in science education , 47(2):183–210, 2011

    2011

  39. [47]

    Overlapping community detection using multi-objective approach and rough clustering

    Darian Horacio Grass-Boada, Airel P ´erez-Su´arez, Leticia Arco, Rafael Bello, and Alejandro Rosete. Overlapping community detection using multi-objective approach and rough clustering. In Rough Sets: Inter- national Joint Conference, IJCRS 2020, Havana, Cuba, June 29–July 3, ...

    2020

  40. [48]

    Improving graph neural network for session-based recommendation system via non-sequential interactions

    Tajuddeen Rabiu Gwadabe and Ying Liu. Improving graph neural network for session-based recommendation system via non-sequential interactions. Neurocomputing, 468:111–122, 2022

    2022

  41. [49]

    Enterprise analytics using graph database and graph-based deep learning

    Shagufta Henna and Shyam Krishnan Kalliadan. Enterprise analytics using graph database and graph-based deep learning. arXiv preprint arXiv:2108.02867, 2021

    2021 arXiv

  42. [50]

    Collabora- tive filtering via graph signal processing

    Weiyu Huang, Antonio G Marques, and Alejandro Ribeiro. Collabora- tive filtering via graph signal processing. In 2017 25th European signal processing conference (EUSIPCO), pages 1094–1098. IEEE, 2017

    2017

  43. [51]

    A multi- level clustering technique for community detection

    Isa Inuwa-Dutse, Mark Liptrott, and Ioannis Korkontzelos. A multi- level clustering technique for community detection. Neurocomputing, 441:64–78, 2021

    2021

  44. [52]

    A graph theory-based modeling of functional brain connectivity based on eeg: a systematic review in the context of neuroergonomics

    Lina Elsherif Ismail and Waldemar Karwowski. A graph theory-based modeling of functional brain connectivity based on eeg: a systematic review in the context of neuroergonomics. Ieee Access , 8:155103– 155135, 2020

    2020

  45. [53]

    Web tool for graph embeddings representation techniques evaluation

    Ilinka Ivanoska, Martin Milenkoski, Slobodan Kalajdziski, and Kire Trivodaliev. Web tool for graph embeddings representation techniques evaluation. In 2019 42nd International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), page...

    2019

  46. [54]

    Learning graph databases: Neo4j an overview

    Meenal Jabde. Learning graph databases: Neo4j an overview

  47. [55]

    Building graphs with maximum connectivity

    Maryam Jafarpour, Mohammad Shekaramiz, Abolfazl Javan, and Ali Moeini. Building graphs with maximum connectivity. In 2020 Intermountain Engineering, Technology and Computing (IETC) , pages 1–5. IEEE, 2020

    2020

  48. [56]

    Graph neural network for traffic forecasting: A survey

    Weiwei Jiang and Jiayun Luo. Graph neural network for traffic forecasting: A survey. Expert systems with applications , 207:117921, 2022

    2022

  49. [57]

    Scalable and optimal planning based on pregel

    Zhihua Jiang and Dongning Rao. Scalable and optimal planning based on pregel. Concurrency and Computation: Practice and Experience , 31(7):e4966, 2019

    2019

  50. [58]

    Application of deep learning methods in biological networks

    Shuting Jin, Xiangxiang Zeng, Feng Xia, Wei Huang, and Xiangrong Liu. Application of deep learning methods in biological networks. Briefings in bioinformatics , 22(2):1902–1917, 2021

    1902

  51. [59]

    Kgnn: Harnessing kernel-based networks for semi- supervised graph classification

    Wei Ju, Junwei Yang, Meng Qu, Weiping Song, Jianhao Shen, and Ming Zhang. Kgnn: Harnessing kernel-based networks for semi- supervised graph classification. In Proceedings of the fifteenth ACM international conference on web search and data mining , pages 421– 429, 2022

    2022

  52. [60]

    Declarative and distributed graph analytics with gradoop

    Martin Junghanns, Max Kießling, Niklas Teichmann, Kevin G ´omez, Andr´e Petermann, and Erhard Rahm. Declarative and distributed graph analytics with gradoop. Proceedings of the VLDB Endowment , 11(12):2006–2009, 2018. Sydney Anuyah, Emmanuel Bolade and Oluwatosin Agbaakin Unde...

    2006

  53. [61]

    Near-storage accelerator for bulk graph ingestion

    Seongyoung Kang and Sang-Woo Jun. Near-storage accelerator for bulk graph ingestion. In 2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) , pages 101–

    2023

  54. [62]

    A circular layout algorithm for attributed hierarchical graphs with ports

    VN Kasyanov, AM Merculov, and TA Zolotuhin. A circular layout algorithm for attributed hierarchical graphs with ports. In Journal of Physics: Conference Series , volume 2099, page 012051. IOP Publish- ing, 2021

    2021

  55. [63]

    Graffinity: Visualizing connectivity in large graphs

    Ethan Kerzner, Alexander Lex, Crystal Lynn Sigulinsky, Timothy Urness, Bryan W Jones, Robert E Marc, and Miriah Meyer. Graffinity: Visualizing connectivity in large graphs. In Computer Graphics Forum, volume 36, pages 251–260. Wiley Online Library, 2017

    2017

  56. [64]

    A shortest path graph attention network and non-traditional multi- deep layouts in robotic mobile fulfillment system

    Kin Lok Keung, Liqiao Xia, Carman KM Lee, and CY Leung. A shortest path graph attention network and non-traditional multi- deep layouts in robotic mobile fulfillment system. In 2022 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), page...

    2022

  57. [65]

    What is a complex graph? Physica A: Statistical Mechanics and its Applications , 387(11):2637– 2652, 2008

    Jongkwang Kim and Thomas Wilhelm. What is a complex graph? Physica A: Statistical Mechanics and its Applications , 387(11):2637– 2652, 2008

    2008

  58. [66]

    Graph rewriting techniques in engineering design

    Lothar Kolbeck, Simon Vilgertshofer, Jimmy Abualdenien, and Andr ´e Borrmann. Graph rewriting techniques in engineering design. Frontiers in built environment, 7:815153, 2022

    2022

  59. [67]

    An efficient graph visualisation framework for refactorerl

    M ´aty´as Kom ´aromi, BOZ ´O Istv ´an, and T ´OTH Melinda. An efficient graph visualisation framework for refactorerl. Studia Universitatis Babes,-Bolyai Informatica, pages 21–36, 2018

    2018

  60. [68]

    Data-to-question generation using deep learning

    Nicole Rachel Koshy, Anshuman Dixit, Siddhi Shrikant Jadhav, Arun V Penmatsa, Sagar V Samanthapudi, Mothi Gowtham Ashok Kumar, Sydney Oghenetega Anuyah, Gourav Vemula, Patricia Snell Herzog, and Davide Bolchini. Data-to-question generation using deep learning. In 2023 4th Inte...

    2023

  61. [69]

    A guide to conquer the biological network era using graph theory

    Mikaela Koutrouli, Evangelos Karatzas, David Paez-Espino, and Geor- gios A Pavlopoulos. A guide to conquer the biological network era using graph theory. Frontiers in bioengineering and biotechnology , 8:34, 2020

    2020

  62. [70]

    Efficient edge rewiring strategies for enhancement in network capacity

    Suchi Kumari, Abhishek Saroha, and Anurag Singh. Efficient edge rewiring strategies for enhancement in network capacity. Physica A: Statistical Mechanics and its Applications , 545:123552, 2020

    2020

  63. [71]

    Conte, Hiroki Arimura, and T

    Kazuhiro Kurita, Kunihiro Wasa, A. Conte, Hiroki Arimura, and T. Uno. Efficient enumeration of subgraphs and induced subgraphs with bounded girth. In European Symposium on Algorithms , 2018

    2018

  64. [72]

    Efficiency analysis of con- ventional and weighted grid-based pathfinding algorithms: A perfor- mance comparative study

    Asi Kuushalie, Gayatri Yerukola, et al. Efficiency analysis of con- ventional and weighted grid-based pathfinding algorithms: A perfor- mance comparative study. In 2024 Third International Conference on Electrical, Electronics, Information and Communication Technologies (ICEEI...

    2024

  65. [73]

    Measuring and improving the core resilience of networks

    Ricky Laishram, Ahmet Erdem Sariy ¨uce, Tina Eliassi-Rad, Ali Pinar, and Sucheta Soundarajan. Measuring and improving the core resilience of networks. In Proceedings of the 2018 World Wide Web Conference , pages 609–618, 2018

    2018

  66. [74]

    The maximum eigenvalue of the brain functional network adjacency matrix: Meaning and application in mental fatigue evaluation

    Gang Li, Yonghua Jiang, Weidong Jiao, Wanxiu Xu, Shan Huang, Zhao Gao, Jianhua Zhang, and Chengwu Wang. The maximum eigenvalue of the brain functional network adjacency matrix: Meaning and application in mental fatigue evaluation. Brain sciences, 10(2):92, 2020

    2020

  67. [75]

    Fraud detection based on graph neural networks with self-attention

    Min Li, Mengjie Sun, Qianlong Liu, and Yumeng Zhang. Fraud detection based on graph neural networks with self-attention. In 2021 2nd International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT), pages 349–353. IEEE, 2021

    2021

  68. [76]

    Re- alizing memory-optimized distributed graph processing

    Panagiotis Liakos, Katia Papakonstantinopoulou, and Alex Delis. Re- alizing memory-optimized distributed graph processing. IEEE Trans- actions on Knowledge and Data Engineering , 30(4):743–756, 2017

    2017

  69. [77]

    On aesthetics for user-sketched layouts of vertex-weighted graphs

    Chun-Cheng Lin, Weidong Huang, Wan-Yu Liu, and Chang-Yu Chen. On aesthetics for user-sketched layouts of vertex-weighted graphs. Journal of Visualization, 24:157–171, 2021

    2021

  70. [78]

    A performance optimization scheme for migrating hive data to neo4j database

    Dan Liu and Ming Ming Li. A performance optimization scheme for migrating hive data to neo4j database. In2018 International Symposium on Computer, Consumer and Control (IS3C) , pages 1–5. IEEE, 2018

    2018

  71. [79]

    From one to all: Learning to match heterogeneous and partially overlapped graphs

    Weijie Liu, Hui Qian, Chao Zhang, Jiahao Xie, Zebang Shen, and Nenggan Zheng. From one to all: Learning to match heterogeneous and partially overlapped graphs. In Proceedings of the AAAI Conference on Artificial Intelligence , volume 36, pages 4109–4119, 2022

    2022

  72. [80]

    A survey on graph classification and link prediction based on gnn

    Xingyu Liu, Juan Chen, and Quan Wen. A survey on graph classification and link prediction based on gnn. arXiv preprint arXiv:2307.00865, 2023

    2023 arXiv

  73. [81]

    Graph-aware collabo- rative filtering for top-n recommendation

    Lianjie Long, Yunfei Yin, and Faliang Huang. Graph-aware collabo- rative filtering for top-n recommendation. In 2021 International Joint Conference on Neural Networks (IJCNN) , pages 1–8. IEEE, 2021

    2021

  74. [82]

    Emj series on statistics and methods part iv: Presenting and summarizing data using graphical tools

    Sileshi Lulseged, Sanni Ali, and Girmay Medhin. Emj series on statistics and methods part iv: Presenting and summarizing data using graphical tools. Ethiopian Medical Journal , 56(4), 2018

    2018

  75. [83]

    Text2nkg: Fine-grained n-ary relation extraction for n-ary relational knowledge graph construction

    Haoran Luo, Yuhao Yang, Tianyu Yao, Yikai Guo, Zichen Tang, Wentai Zhang, Kaiyang Wan, Shiyao Peng, Meina Song, Wei Lin, et al. Text2nkg: Fine-grained n-ary relation extraction for n-ary relational knowledge graph construction. arXiv preprint arXiv:2310.05185, 2023

    arXiv

  76. [84]

    Stream- ing graph neural networks

    Yao Ma, Ziyi Guo, Zhaocun Ren, Jiliang Tang, and Dawei Yin. Stream- ing graph neural networks. In Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval, pages 719–728, 2020

    2020

  77. [85]

    Relating aesthetics of the gui text elements with readability using font family

    Ranjan Maity and Samit Bhattacharya. Relating aesthetics of the gui text elements with readability using font family. In Proceedings of the 2018 ACM Companion International Conference on Interactive Surfaces and Spaces , pages 63–68, 2018

    2018

  78. [86]

    Graph theory: A comprehensive survey about graph theory applications in computer science and social networks

    Abdul Majeed and Ibtisam Rauf. Graph theory: A comprehensive survey about graph theory applications in computer science and social networks. Inventions, 5(1):10, 2020

    2020

  79. [87]

    Diametral paths in total graphs of complete graphs, complete bipartite graphs and wheels

    Tabitha Agnes Mangam and Joseph Varghese Kureethara. Diametral paths in total graphs of complete graphs, complete bipartite graphs and wheels. Int. J. Civil Eng. Tech , 8(5):1212–1219, 2017

    2017

  80. [88]

    A vertex-similarity clustering algorithm for community detection

    Antonio Maria Fiscarelli, Matthias R Brust, Gr ´egoire Danoy, and Pascal Bouvry. A vertex-similarity clustering algorithm for community detection. Journal of Information and Telecommunication, 4(1):36–50, 2020

    2020

  81. [89]

    Lagraph: A community effort to collect graph algorithms built on top of the graphblas

    Tim Mattson, Timothy A Davis, Manoj Kumar, Aydin Buluc, Scott McMillan, Jos´e Moreira, and Carl Yang. Lagraph: A community effort to collect graph algorithms built on top of the graphblas. In 2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDP...

    2019

  82. [90]

    A comparative study of mongodb, arangodb and couchdb for big data storage

    Konstanitnos Mavrogiorgos, Athanasios Kiourtis, Argyro Mavrogior- gou, and Dimosthenis Kyriazis. A comparative study of mongodb, arangodb and couchdb for big data storage. In Proceedings of the 2021 5th International Conference on Cloud and Big Data Computing, pages 8–14, 2021

    2021

  83. [91]

    Resilience analysis of new york city transportation network after snow storms

    Reza Mirjalili, Hojjat Barati, and Anil Yazici. Resilience analysis of new york city transportation network after snow storms. Transportation research record, 2677(1):694–707, 2023

    2023

  84. [92]

    Classifying the influential individuals in multi-layer social networks

    Ruchi Mittal and MPS Bhatia. Classifying the influential individuals in multi-layer social networks. International Journal of Electronics, Communications, and Measurement Engineering (IJECME) , 8(1):21– 32, 2019

    2019

  85. [93]

    Variable neighborhood search

    Nenad Mladenovi ´c and Pierre Hansen. Variable neighborhood search. Computers & operations research , 24(11):1097–1100, 1997

    1997

  86. [94]

    Language and hardware acceleration backend for graph processing

    Andrey Mokhov, Alessandro De Gennaro, Ghaith Tarawneh, Jonny Wray, Georgy Lukyanov, Sergey Mileiko, Joe Scott, Alex Yakovlev, and Andrew Brown. Language and hardware acceleration backend for graph processing. In 2017 Forum on Specification and Design Languages (FDL), pages 1–7...

    2017

  87. [95]

    Financial fraud detection using graph neural networks: A systematic review

    Soroor Motie and Bijan Raahemi. Financial fraud detection using graph neural networks: A systematic review. Expert Systems with Applications, 240:122156, 2024

    2024

  88. [96]

    Heterogeneous in- formation fusion based graph collaborative filtering recommendation

    Ruihui Mu, Xiaoqin Zeng, and Jiying Zhang. Heterogeneous in- formation fusion based graph collaborative filtering recommendation. Intelligent Data Analysis , 27(6):1595–1613, 2023

    2023

  89. [97]

    M n– polynomials of some special graphs

    Raghad Mustafa, Ahmed M Ali, and AbdulSattar M Khidhir. M n– polynomials of some special graphs. Iraqi Journal of Science , pages 1986–1993, 2021

    1986

  90. [98]

    Biological network analysis with deep learning

    Giulia Muzio, Leslie O’Bray, and Karsten Borgwardt. Biological network analysis with deep learning. Briefings in bioinformatics , 22(2):1515–1530, 2021

    2021

  91. [99]

    Example-based explanations for streaming fraud detection on graphs

    Thanh Tam Nguyen, Thanh Cong Phan, Hien Thu Pham, Thanh Thi Nguyen, Jun Jo, and Quoc Viet Hung Nguyen. Example-based explanations for streaming fraud detection on graphs. Information Sciences, 621:319–340, 2023

    2023

  92. [100]

    Network analysis with the aid of the path length matrix

    Silvia Noschese and Lothar Reichel. Network analysis with the aid of the path length matrix. Numerical Algorithms, 95(1):451–470, 2024

    2024

  93. [101]

    Machine learning-based selection of graph partitioning strategy using the charac- teristics of graph data and algorithm

    YoungJoon Park, DongKyu Lee, and Tien-Cuong Bui. Machine learning-based selection of graph partitioning strategy using the charac- teristics of graph data and algorithm. arXiv preprint arXiv:2209.04137, 2022

    2022 arXiv

  94. [102]

    A review on graph database and its representation

    Subrata Paul, Anirban Mitra, and Chandan Koner. A review on graph database and its representation. In 2019 International Conference on Sydney Anuyah, Emmanuel Bolade and Oluwatosin Agbaakin Understanding Graph Databases: A Comprehensive Tutorial and Survey Recent Advances in E...

    2019

  95. [103]

    Knowledge graph aware text classification

    Nela Petr ˇzelkov´a, Bla ˇz ˇSkrlj, and Nada Lavra ˇc. Knowledge graph aware text classification. 2020

    2020

  96. [104]

    Discrim- inability of single-layer graph neural networks

    Samuel Pfrommer, Alejandro Ribeiro, and Fernando Gama. Discrim- inability of single-layer graph neural networks. In ICASSP 2021- 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 8508–8512. IEEE, 2021

    2021

  97. [105]

    Supporting data types in neo4j

    Kornelije Rabuzin, Maja Cerjan, and Snje ˇzana Kri ˇzani´c. Supporting data types in neo4j. In European Conference on Advances in Databases and Information Systems , pages 459–466. Springer, 2022

    2022

  98. [106]

    Fruchterman-Reingold Algorithm for Force-Directed Graph Drawing

    Antonia Rado ˇs. Fruchterman-Reingold Algorithm for Force-Directed Graph Drawing. PhD thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2019

    2019

  99. [107]

    A review of application of graph theory for network

    AB Sadavare and RV Kulkarni. A review of application of graph theory for network. International Journal of Computer science and Information technologies, 3(6):5296–5300, 2012

    2012

  100. [108]

    Using link features for entity clustering in knowledge graphs

    Alieh Saeedi, Eric Peukert, and Erhard Rahm. Using link features for entity clustering in knowledge graphs. In European Semantic Web Conference, pages 576–592. Springer, 2018

    2018

  101. [109]

    The ubiquity of large graphs and surprising challenges of graph processing: extended survey

    Siddhartha Sahu, Amine Mhedhbi, Semih Salihoglu, Jimmy Lin, and M Tamer ¨Ozsu. The ubiquity of large graphs and surprising challenges of graph processing: extended survey. The VLDB journal, 29:595–618, 2020

    2020

  102. [110]

    A gentle introduction to graph neural networks

    Benjamin Sanchez-Lengeling, Emily Reif, Adam Pearce, and Alexan- der B Wiltschko. A gentle introduction to graph neural networks. Distill, 6(9):e33, 2021

    2021

  103. [111]

    Collaborative filtering using graph kernel and boosting

    Mittu Satheesh and G Remya. Collaborative filtering using graph kernel and boosting. In 2017 International Conference on Computational Intelligence in Data Science (ICCIDS) , pages 1–4. IEEE, 2017

    2017

  104. [112]

    Graph-representation of patient data: a systematic literature review

    Jens Schrodt, Aleksei Dudchenko, Petra Knaup-Gregori, and Matthias Ganzinger. Graph-representation of patient data: a systematic literature review. Journal of medical systems , 44(4):86, 2020

    2020

  105. [113]

    Square distance in graphs

    V Thamarai Selvi and Pandian Vaidhyanathan. Square distance in graphs. International Journal of Information Technology, Research and Applications, 2(3):5–11, 2023

    2023

  106. [114]

    Bidirectional value driven design between economical plan- ning and technical implementation based on data graph, information graph and knowledge graph

    Lixu Shao, Yucong Duan, Xiaobing Sun, Quan Zou, Rongqi Jing, and Jiami Lin. Bidirectional value driven design between economical plan- ning and technical implementation based on data graph, information graph and knowledge graph. In 2017 IEEE 15th International Confer- ence on ...

    2017

  107. [115]

    Cardi- nality estimation of subgraph matching: A filtering-sampling approach

    Wonseok Shin, Siwoo Song, Kunsoo Park, and Wook-Shin Han. Cardi- nality estimation of subgraph matching: A filtering-sampling approach. arXiv preprint arXiv:2309.15433 , 2023

    2023 arXiv

  108. [116]

    Loop unrolling effect on parallel code optimization

    Karim Soliman, Marwa El Shenawy, and Ahmed Abou El Farag. Loop unrolling effect on parallel code optimization. In Proceedings of the 2nd International Conference on Future Networks and Distributed Systems, pages 1–6, 2018

    2018

  109. [117]

    Plug-and-play networks: Adding vertices and connections to preserve algebraic connectivity

    Sonja St ¨udli, Yamin Yan, Maria M Seron, and Richard H Middleton. Plug-and-play networks: Adding vertices and connections to preserve algebraic connectivity. In 2021 60th IEEE Conference on Decision and Control (CDC), pages 4823–4828. IEEE, 2021

    2021

  110. [118]

    Graphh: High performance big graph analytics in small clusters

    Peng Sun, Yonggang Wen, Ta Nguyen Binh Duong, and Xiaokui Xiao. Graphh: High performance big graph analytics in small clusters. In 2017 IEEE International Conference on Cluster Computing (CLUS- TER), pages 256–266. IEEE, 2017

    2017

  111. [119]

    Scaling up subgraph query processing with efficient subgraph matching

    Shixuan Sun and Qiong Luo. Scaling up subgraph query processing with efficient subgraph matching. In 2019 IEEE 35th International Conference on Data Engineering (ICDE), pages 220–231. IEEE, 2019

    2019

  112. [120]

    The performance evaluation and resilience analysis of supply chain based on logistics network

    Weiqi Sun, Yuanlong Li, and Liangren Shi. The performance evaluation and resilience analysis of supply chain based on logistics network. In 2020 39th Chinese Control Conference (CCC) , pages 5772–5777. IEEE, 2020

    2020

  113. [121]

    Intelligent Systems and Data Science: First International Conference, ISDS 2023, Can Tho, Vietnam, November 11–12, 2023, Proceedings, Part I

    Nguyen Thai-Nghe, Thanh-Nghi Do, and Peter Haddawy. Intelligent Systems and Data Science: First International Conference, ISDS 2023, Can Tho, Vietnam, November 11–12, 2023, Proceedings, Part I . Springer Nature, 2023

    2023

  114. [122]

    On some studies of fraud detection pipeline and related issues from the scope of ensemble learning and graph-based learning

    Tuan Tran. On some studies of fraud detection pipeline and related issues from the scope of ensemble learning and graph-based learning. arXiv preprint arXiv:2205.04626 , 2022

    2022 arXiv

  115. [123]

    Study of layout structure characteristics using graph-analytical schemes and tools of spatial syntax theory

    Dmitry Sergeevich Tseluyko and Arina Romanovna Kirpo. Study of layout structure characteristics using graph-analytical schemes and tools of spatial syntax theory. Bulletin of Tomsk State University of Architecture and Building, 25(3):39–53, 2023

    2023

  116. [124]

    Between- ness centrality in convex amalgamation of graphs

    Sunil Kumar Raghavan Unnithan and Kannan Balakrishnan. Between- ness centrality in convex amalgamation of graphs. Journal of Algebra Combinatorics Discrete Structures and Applications, 6(1):21–38, 2019

    2019

  117. [125]

    Store and visualize eer in neo4j

    Anik ´o V ´agner. Store and visualize eer in neo4j. In Proceedings of the 2nd International Symposium on Computer Science and Intelligent Control, pages 1–6, 2018

    2018

  118. [126]

    Dynamic portfolio rebalancing: A hybrid new model using gnns and pathfinding for cost efficiency

    Diego Vallarino. Dynamic portfolio rebalancing: A hybrid new model using gnns and pathfinding for cost efficiency. arXiv preprint arXiv:2410.01864, 2024

    2024 arXiv

  119. [127]

    Graph-optimizer: To- wards predictable large-scale graph processing workloads

    Ana Lucia Varbanescu and Andrea Bartolini. Graph-optimizer: To- wards predictable large-scale graph processing workloads. In Compan- ion of the 2023 ACM/SPEC International Conference on Performance Engineering, pages 255–256, 2023

    2023

  120. [128]

    Everything is connected: Graph neural networks

    Petar Veli ˇckovi´c. Everything is connected: Graph neural networks. Current Opinion in Structural Biology , 79:102538, 2023

    2023

  121. [129]

    A study of connec- tivity on dynamic graphs: computing persistent connected components

    Mathilde Vernet, Yoann Pign ´e, and Eric Sanlaville. A study of connec- tivity on dynamic graphs: computing persistent connected components. 4OR, 21(2):205–233, 2023

    2023

  122. [130]

    General degree distance of graphs

    Tom ´aˇs Vetr´ık. General degree distance of graphs. Journal of Algebra Combinatorics Discrete Structures and Applications , 8(2):107–118, 2021

    2021

  123. [131]

    Optimization in the parallelism extraction algorithm with spanning tree on a multi- gpu environment

    Guyue Wang, Koichi Wada, and Shinichi Yamagiwa. Optimization in the parallelism extraction algorithm with spanning tree on a multi- gpu environment. IEEJ Transactions on Electrical and Electronic Engineering, 14(6):862–869, 2019

    2019

  124. [132]

    Metrics for graph comparison: a practitioner’s guide

    Peter Wills and Franc ¸ois G Meyer. Metrics for graph comparison: a practitioner’s guide. Plos one, 15(2):e0228728, 2020

    2020

  125. [133]

    Graph-xll: a graph library for extra large graph analytics on a single machine

    Jian Wu, Venkatesh Srinivasan, and Alex Thomo. Graph-xll: a graph library for extra large graph analytics on a single machine. In 2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA) , pages 1–7. IEEE, 2019

    2019

  126. [134]

    Graph neural networks in recommender systems: a survey

    Shiwen Wu, Fei Sun, Wentao Zhang, Xu Xie, and Bin Cui. Graph neural networks in recommender systems: a survey. ACM Computing Surveys, 55(5):1–37, 2022

    2022

  127. [135]

    Knowledge graph enhanced sentential relation extraction via dual heterogeneous graph context selection

    Bo Xu, Nian Liu, Luyi Cheng, Shizhou Huang, Shouang Wei, Ming Du, Hui Song, and Hongya Wang. Knowledge graph enhanced sentential relation extraction via dual heterogeneous graph context selection. In 2023 International Joint Conference on Neural Networks (IJCNN) , pages 1–7. I...

    2023

  128. [136]

    The algebraic connectivity of graphs with given circumference

    Jie Xue, Huiqiu Lin, and Jinlong Shu. The algebraic connectivity of graphs with given circumference. Theoretical Computer Science , 772:123–131, 2019

    2019

  129. [137]

    Extract and refine: Finding a support subgraph set for graph representation

    Kuo Yang, Zhengyang Zhou, Wei Sun, Pengkun Wang, Xu Wang, and Yang Wang. Extract and refine: Finding a support subgraph set for graph representation. In Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , pages 2953– 2964, 2023

    2023

  130. [138]

    Give us the facts: Enhancing large language models with knowledge graphs for fact-aware language modeling

    Linyao Yang, Hongyang Chen, Zhao Li, Xiao Ding, and Xindong Wu. Give us the facts: Enhancing large language models with knowledge graphs for fact-aware language modeling. IEEE Transactions on Knowledge and Data Engineering , 2024

    2024

  131. [139]

    Operational resilience of network considering common-cause failures

    Tetsushi Yuge, Yasumasa Sagawa, and Natsumi Takahashi. Operational resilience of network considering common-cause failures. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 107(6):855–863, 2024

    2024

  132. [140]

    Subgraph feature extraction based on multi-view dictionary learning for graph classification

    Xin Zheng, Shouzhi Liang, Bo Liu, Xiaoming Xiong, Xianghong Hu, and Yuan Liu. Subgraph feature extraction based on multi-view dictionary learning for graph classification. Knowledge-Based Systems, 214:106716, 2021

    2021

  133. [141]

    Towards data-centric graph machine learning: Review and outlook

    Xin Zheng, Yixin Liu, Zhifeng Bao, Meng Fang, Xia Hu, Alan Wee- Chung Liew, and Shirui Pan. Towards data-centric graph machine learning: Review and outlook. arXiv preprint arXiv:2309.10979, 2023

    2023 arXiv

  134. [142]

    Research on the discovery of opinion leaders in social networks

    Chufeng Zhou, Xinxin Guan, Yeli Li, and Qingtao Zeng. Research on the discovery of opinion leaders in social networks. In IOP Conference Series: Materials Science and Engineering , volume 563, page 032009. IOP Publishing, 2019

    2019

  135. [143]

    An edge-cloud collaboration framework for graph processing in smart society

    Jun Zhou and Masaaki Kondo. An edge-cloud collaboration framework for graph processing in smart society. IEEE Transactions on Emerging Topics in Computing, 2023

    2023

  136. [144]

    Improved pagerank algorithm combined user behavior with topic similarity

    Hao-dong ZHU and Bao-feng HE. Improved pagerank algorithm combined user behavior with topic similarity. Sydney Anuyah, Emmanuel Bolade and Oluwatosin Agbaakin

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.