Log in

Relevant bibliographies by topics / Relations with graph theory

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Relations with graph theory'

Author: Grafiati

Published: 4 June 2021

Last updated: 28 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Relations with graph theory.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Relations with graph theory"

1

Weaver, Nik. "Quantum Graphs as Quantum Relations." Journal of Geometric Analysis 31, no. 9 (2021): 9090–112. http://dx.doi.org/10.1007/s12220-020-00578-w.

Full text

Abstract:

AbstractThe “noncommutative graphs” which arise in quantum error correction are a special case of the quantum relations introduced in Weaver (Quantum relations. Mem Am Math Soc 215(v–vi):81–140, 2012). We use this perspective to interpret the Knill–Laflamme error-correction conditions (Knill and Laflamme in Theory of quantum error-correcting codes. Phys Rev A 55:900-911, 1997) in terms of graph-theoretic independence, to give intrinsic characterizations of Stahlke’s noncommutative graph homomorphisms (Stahlke in Quantum zero-error source-channel coding and non-commutative graph theory. IEEE Tr

APA, Harvard, Vancouver, ISO, and other styles

2

ILYUTKO, DENIS PETROVICH, and VASSILY OLEGOVICH MANTUROV. "INTRODUCTION TO GRAPH-LINK THEORY." Journal of Knot Theory and Its Ramifications 18, no. 06 (2009): 791–823. http://dx.doi.org/10.1142/s0218216509007191.

Full text

Abstract:

The present paper is an introduction to a combinatorial theory arising as a natural generalization of classical and virtual knot theory. There is a way to encode links by a class of "realizable" graphs. When passing to generic graphs with the same equivalence relations we get "graph-links". On one hand graph-links generalize the notion of virtual link, on the other hand they do not detect link mutations. We define the Jones polynomial for graph-links and prove its invariance. We also prove some a generalization of the Kauffman–Murasugi–Thistlethwaite theorem on "minimal diagrams" for graph-lin

APA, Harvard, Vancouver, ISO, and other styles

3

Prabha, S. Celine, M. Palanivel, S. Amutha, et al. "Solutions of Detour Distance Graph Equations." Sensors 22, no. 21 (2022): 8440. http://dx.doi.org/10.3390/s22218440.

Full text

Abstract:

Graph theory is a useful mathematical structure used to model pairwise relations between sensor nodes in wireless sensor networks. Graph equations are nothing but equations in which the unknown factors are graphs. Many problems and results in graph theory can be formulated in terms of graph equations. In this paper, we solved some graph equations of detour two-distance graphs, detour three-distance graphs, detour antipodal graphs involving with the line graphs.

APA, Harvard, Vancouver, ISO, and other styles

4

Aharwal, Ramesh Prasad. "Graph Theory Applications in Machine Learning." International Journal for Research in Applied Science and Engineering Technology 13, no. 3 (2025): 645–48. https://doi.org/10.22214/ijraset.2025.67337.

Full text

Abstract:

Graph theory is the Branch of Discrete mathematics which plays a key role in Machine Learning and Data Science. Graph Theory in Machine Learning states to the application of mathematical structures known as graphs to model pairwise relations between objects in machine learning. A graph in this framework is a set of objects, called nodes, connected by links, known as edges. Each edge may be directed or undirected. In mathematics, graph theory is one of the important fields used in structural models. This paper explores the applications of Graph theory and various types of graphs in Machine Lear

APA, Harvard, Vancouver, ISO, and other styles

5

Yurttas Gunes, Aysun, Muge Togan, Musa Demirci, and Ismail Naci Cangul. "Harmonic Index and Zagreb Indices of Vertex-Semitotal Graphs." European Journal of Pure and Applied Mathematics 13, no. 5 (2020): 1260–69. http://dx.doi.org/10.29020/nybg.ejpam.v13i5.3725.

Full text

Abstract:

Graph theory is one of the rising areas in mathematics due to its applications in many areas of science. Amongst several study areas in graph theory, spectral graph theory and topological descriptors are in front rows. These descriptors are widely used in QSPR/QSAR studies in mathematical chemistry. Vertex-semitotal graphs are one of the derived graph classes which are useful in calculating several physico-chemical properties of molecular structures by means of molecular graphs modelling the molecules. In this paper, several topological descriptors of vertex-semitotal graphs are calculated. So

APA, Harvard, Vancouver, ISO, and other styles

6

Zhou, Chao, and Yan Ping Liu. "Study on Parameter Transfer Structure of Generalized Modular Based Graph Theory." Advanced Materials Research 562-564 (August 2012): 1323–26. http://dx.doi.org/10.4028/www.scientific.net/amr.562-564.1323.

Full text

Abstract:

For the purpose of reducing product structure levels and shorting transfer chain of parameter, in this paper the product structure levels are expressed with generalized modular. The concept of directed graph of parameter connection structure for generalized modular is proposed with the use of directed graph theory, generalized modular, sub-modular and part represented by vertex, the driven relations of parameter connection represented by directed edge, and the properties of directed graph of parameter connection structure for generalized modular are gained. The directed graph of parameter conn

APA, Harvard, Vancouver, ISO, and other styles

7

Javaid, Imran, Shahroz Ali, Shahid Ur Rehman, and Aqsa Shah. "Rough sets in graphs using similarity relations." AIMS Mathematics 7, no. 4 (2022): 5790–807. http://dx.doi.org/10.3934/math.2022320.

Full text

Abstract:

<abstract><p>In this paper, we investigate the theory of rough set to study graphs using the concept of orbits. Rough sets are based on a clustering criterion and we use the idea of similarity of vertices under automorphism as a criterion. We introduce indiscernibility relation in terms of orbits and prove necessary and sufficient conditions under which the indiscernibility partitions remain the same when associated with different attribute sets. We show that automorphisms of the graph $ \mathcal{G} $ preserve the indiscernibility partitions. Further, we prove that for any graph $

APA, Harvard, Vancouver, ISO, and other styles

8

Hashemi, Ebrahim, Mona Abdi, Abdollah Alhevaz, and Huadong Su. "Domination number of graphs associated with rings." Journal of Algebra and Its Applications 19, no. 01 (2019): 2050009. http://dx.doi.org/10.1142/s0219498820500097.

Full text

Abstract:

The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. Let [Formula: see text] be an associative (not necessarily commutative) ring. We focus on the domination number of the zero-divisor graph [Formula: see text], the compressed zero-divisor graph [Formula: see text] and the unit graph [Formula: see text]. We find some relations between the domination number of the zero-divisor graph and that of the compressed zero-divisor graph. Moreover, some relations between the domination number of [Formula: s

APA, Harvard, Vancouver, ISO, and other styles

9

SHENOY, PRAKASH P. "REPRESENTING CONDITIONAL INDEPENDENCE RELATIONS BY VALUATION NETWORKS." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 02, no. 02 (1994): 143–65. http://dx.doi.org/10.1142/s0218488594000134.

Full text

Abstract:

Valuation networks have been proposed as graphical representations of valuation-based systems. The axiomatic framework of valuation-based systems is able to capture many uncertainty calculi including probability theory, Dempster-Shafer's belief-function theory, Spohn's epistemic belief theory, and Zadeh's possibility theory. In this paper, we show how valuation networks encode conditional independence relations. For the probabilistic case, the class of probability models encoded by valuation networks includes undirected graph models, directed acyclic graph models, directed balloon graph models

APA, Harvard, Vancouver, ISO, and other styles

10

De Bueriis, Giustino, and Alberto Maria Langella. "Algebraic Lexicon Grammar." International Journal of Linguistics 11, no. 3 (2019): 21. http://dx.doi.org/10.5296/ijl.v11i3.14766.

Full text

Abstract:

This article aims at showing an application of graph theory to the description of the syntactic relations between words in English. Graph theory is part of Network Science, a new and compelling branch of mathematics that has undergone huge development over the past 20 years. The linguistic theoretical background is the Lexicon Grammar (LG) that in turn is built on the ground of the Harrisian grammar for operators and arguments. Graph theory is particularly useful in order to show how sentences have underlying structures that can be visualized through the use of graphs, and whose properties can

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Relations with graph theory"

1

Dube, Matthew P. "An Embedding Graph for 9-Intersection Topological Spatial Relations." Fogler Library, University of Maine, 2009. http://www.library.umaine.edu/theses/pdf/DubeMP2009.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lucas, Claire. "Trois essais sur les relations entre les invariants structuraux des graphes et le spectre du Laplacien sans signe." Phd thesis, Ecole Polytechnique X, 2013. http://pastel.archives-ouvertes.fr/pastel-00956183.

Full text

Abstract:

Le spectre du Laplacien sans signe a fait l'objet de beaucoup d'attention dans la communauté scientifique ces dernières années. La principale raison est l'intuition, basée sur une étude des petits graphes et sur des propriétés valides pour des graphes de toutes tailles, que plus de graphes sont déterminés par le spectre de cette matrice que par celui de la matrice d'adjacence et du Laplacien. Les travaux présentés dans cette thèse ont apporté des éléments nouveaux sur les informations contenues dans le spectre cette matrice. D'une part, on y présente des relations entre les invariants de struc

APA, Harvard, Vancouver, ISO, and other styles

3

Zhou, Xinwei. "Reachability relations in selective regression testing." Thesis, London South Bank University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265281.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Sun, Pak Kiu. "Incidence coloring : origins, developments and relation with other colorings." HKBU Institutional Repository, 2007. http://repository.hkbu.edu.hk/etd_ra/826.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Perissinotti, Bisoni Roberta. "Relations among Shakespeare's characters: an analysis in terms of centrality measures and new tecniques from graph theory." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/15001/.

Full text

Abstract:

This work analyzes some aspects of two problems in graph theory: centrality measures that allow us to detect the most important group of nodes in a network and the clustering of a graph in coherent sub-communities. We propose two new centrality measures that are the results of a new point of view and we suggest a new algorithm to detect communities. We apply all the results to analyze drama, in particular five Shakespeare's plays.

APA, Harvard, Vancouver, ISO, and other styles

6

Kwok, Wing-hong, and 郭永康. "Streamlined and prioritized hierarchical relations: a technique for improving the effectiveness of theclassification-tree methodology." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B2975107X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Knight, Daniel William. "Reactor behavior and its relation to chemical reaction network structure." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1438274630.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Racataian, Valentin Jean. "Various Steiner Systems." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2574.

Full text

Abstract:

This project deals with the automorphism group G of a Steiner system S (3, 4, 10). S₁₀, the symmetrical group of degree 10, acts transitively on T, the set of all Steiner systems with parameters 3, 4, 10. The purpose of this project is to study the action of S₁₀ on cosets of G. This will be achieved by means of a graph of S₁₀ on T x T. The orbits of S₁₀ on T x T are in one-one correspondence with the orbits of G, the stabilizer of an S [e] T on T.

APA, Harvard, Vancouver, ISO, and other styles

9

Silva, Marcel Kenji de Carli. "Relações min-max em otimização combinatória." Universidade de São Paulo, 2007. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-08052007-182205/.

Full text

Abstract:

Relações min-max são objetos centrais em otimização combinatória. Elas basicamente afirmam que, numa dada estrutura, o valor ótimo de um certo problema de minimização é igual ao valor ótimo de um outro problema de maximização. Relações desse tipo fornecem boas caracterizações e descrições poliédricas para diversos problemas importantes, além de geralmente virem acompanhadas de algoritmos eficientes para os problemas em questão. Muitas vezes, tais algoritmos eficientes são obtidos naturalmente das provas construtivas dessas relações; mesmo quando isso não ocorre, essas relações revelam o sufici

APA, Harvard, Vancouver, ISO, and other styles

10

Maturana, Miranda Francisco Ramón Javier. "Le système des villes moyennes du sud du Chili, vers la construction de nouveaux espaces de relations ?" Thesis, Paris 4, 2012. http://www.theses.fr/2012PA040082.

Full text

Abstract:

La question des villes moyennes ou intermédiaires a été largement débattue, en raison de la difficulté à établir leur définition. Un système de villes moyennes particulier est situé au sud du Chili, constitué par les régions de La Araucanía, Los Ríos et Los Lagos. Ce système présente une configuration spatiale plutôt monocentrique, où les interactions entre villes sont développées à l'intérieur de chaque région et, par conséquence, les liens transfrontaliers sont faibles voire inexistants. Les centres urbains à l'intérieur de chaque région développent différents types de configuration spatiale

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Relations with graph theory"

1

Fraïssé, Roland. La reconstruction d'une relation dans l'hypothèse forte: Isomorphie des restrictions à chaque partie stricte de la base. Presses de l'Université Laval, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bader, David A., 1969- editor of compilation, Meyerhenke, Henning, 1978- editor of compilation, Sanders, Peter, editor of compilation, and Wagner, Dorothea, 1957- editor of compilation, eds. Graph partitioning and graph clustering: 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA. American Mathematical Society, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Janowitz, M. F. Ordinal and relational clustering. World Scientific, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

R, Simion, ed. Combinatorics and theoretical computer science: Proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science, Washington, DC, 1989. North-Holland, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Gould, Ronald. Graph theory. Benjamin/Cummings Pub. Co., 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Gera, Ralucca, Stephen Hedetniemi, and Craig Larson, eds. Graph Theory. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-31940-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bondy, J. A., and U. S. R. Murty. Graph Theory. Springer London, 2008. http://dx.doi.org/10.1007/978-1-84628-970-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Diestel, Reinhard. Graph Theory. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14279-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Gera, Ralucca, Teresa W. Haynes, and Stephen T. Hedetniemi, eds. Graph Theory. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-97686-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Diestel, Reinhard. Graph Theory. Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-53622-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Relations with graph theory"

1

Mathew, Sunil, John N. Mordeson, and Davender S. Malik. "Fuzzy Sets and Relations." In Fuzzy Graph Theory. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71407-3_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Yadav, Santosh Kumar. "Relations." In Discrete Mathematics with Graph Theory. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-21321-2_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Rama, R. "Recurrence Relations." In Topics in Combinatorics and Graph Theory. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-74252-1_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Cioabă, Sebastian M., and M. Ram Murty. "Recurrence Relations." In A First Course in Graph Theory and Combinatorics. Hindustan Book Agency, 2009. http://dx.doi.org/10.1007/978-93-86279-39-2_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kurasov, Pavel. "The Trace Formula." In Operator Theory: Advances and Applications. Springer Berlin Heidelberg, 2023. http://dx.doi.org/10.1007/978-3-662-67872-5_8.

Full text

Abstract:

AbstractThis chapter is devoted to the trace formula connecting the spectrum of a finite compact metric graph with the set of closed paths on it. In other words this formula establishes a relation between spectral and geometric/topologic properties of metric graphs.

APA, Harvard, Vancouver, ISO, and other styles

6

Xu, Jin. "Kempe Change." In Maximal Planar Graph Theory and the Four-Color Conjecture. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-4745-3_9.

Full text

Abstract:

Abstract The Kempe change is the essence of the Kempe’s “proof” of the Four Color Conjecture (Kempe, Am. J. Math. 2(3), 193–200 (1879)), by which a new 4-coloring of a maximal planar graph can be generated from a given 4-coloring. The fundamental reason why it fails to prove the Four Color Conjecture by using this technique is that there exist many maximal planar graphs G such that the set of all 4-colorings of G can not be generated by applying Kempe change from any given 4-colorings of G. Nevertheless, due to the NP-completeness of the vertex coloring of graphs, Kempe change has been a funda

APA, Harvard, Vancouver, ISO, and other styles

7

Léonard, Michel. "Transformation of a decomposition into a relation graph." In Database Design Theory. Macmillan Education UK, 1992. http://dx.doi.org/10.1007/978-1-349-11979-0_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zimmermann, H. J. "Fuzzy Relations and Fuzzy Graphs." In Fuzzy Set Theory—and Its Applications. Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-015-8702-0_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zimmermann, H. J. "Fuzzy Relations and Fuzzy Graphs." In Fuzzy Set Theory—and Its Applications. Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-010-0646-0_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zimmermann, H. J. "Fuzzy Relations and Fuzzy Graphs." In Fuzzy Set Theory — and Its Applications. Springer Netherlands, 1991. http://dx.doi.org/10.1007/978-94-015-7949-0_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Relations with graph theory"

1

Huang, Zhichao, Xutao Li, Yunming Ye, and Michael K. Ng. "MR-GCN: Multi-Relational Graph Convolutional Networks based on Generalized Tensor Product." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/175.

Full text

Abstract:

Graph Convolutional Networks (GCNs) have been extensively studied in recent years. Most of existing GCN approaches are designed for the homogenous graphs with a single type of relation. However, heterogeneous graphs of multiple types of relations are also ubiquitous and there is a lack of methodologies to tackle such graphs. Some previous studies address the issue by performing conventional GCN on each single relation and then blending their results. However, as the convolutional kernels neglect the correlations across relations, the strategy is sub-optimal. In this paper, we propose the Multi

APA, Harvard, Vancouver, ISO, and other styles

2

"MAPPING KNOWLEDGE DOMAINS - Combining Symbolic Relations with Graph Theory." In Special Session on Text Mining. SciTePress - Science and and Technology Publications, 2011. http://dx.doi.org/10.5220/0003721105270536.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chen, Fengwen, Guodong Long, Zonghan Wu, Tianyi Zhou, and Jing Jiang. "Personalized Federated Learning With a Graph." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/357.

Full text

Abstract:

Knowledge sharing and model personalization are two key components in the conceptual framework of personalized federated learning (PFL). Existing PFL methods focus on proposing new model personalization mechanisms while simply implementing knowledge sharing by aggregating models from all clients, regardless of their relation graph. This paper aims to enhance the knowledge-sharing process in PFL by leveraging the graph-based structural information among clients. We propose a novel structured federated learning (SFL) framework to learn both the global and personalized models simultaneously using

APA, Harvard, Vancouver, ISO, and other styles

4

Aruna, Chittineni, and R. Siva Ram Prasad. "Adopting Metamorphic Relations to Verify Non-Testable Graph theory Algorithms." In 2015 Second International Conference on Advances in Computing and Communication Engineering (ICACCE). IEEE, 2015. http://dx.doi.org/10.1109/icacce.2015.138.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Li, Jinping. "Study on Social Relations between Individuals Based on Graph Theory." In Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007). IEEE, 2007. http://dx.doi.org/10.1109/fskd.2007.545.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Qin, Guangming, Jianpeng Qi, Bin Wang, Guiyuan Jiang, Yanwei Yu, and Junyu Dong. "Multi-Relational Graph Attention Network for Social Relationship Inference from Human Mobility Data." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/256.

Full text

Abstract:

Inferring social relationships from human mobility data holds significant value in real-life spatio-temporal applications, which inspires the development of a series of graph-based methods for inferring social relationships. Despite their effectiveness, we argue that previous methods either rely solely on direct relations between users, neglecting valuable user mobility patterns, or have not fully harnessed the indirect interactions, thereby struggling to capture users' mobility preferences. To address these issues, in this work, we propose the Multi-Relational Graph Attention Network (MRGAN),

APA, Harvard, Vancouver, ISO, and other styles

7

Fatemi, Bahare, Perouz Taslakian, David Vazquez, and David Poole. "Knowledge Hypergraphs: Prediction Beyond Binary Relations." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/303.

Full text

Abstract:

Knowledge graphs store facts using relations between two entities. In this work, we address the question of link prediction in knowledge hypergraphs where relations are defined on any number of entities. While techniques exist (such as reification) that convert non-binary relations into binary ones, we show that current embedding-based methods for knowledge graph completion do not work well out of the box for knowledge graphs obtained through these techniques. To overcome this, we introduce HSimplE and HypE, two embedding-based methods that work directly with knowledge hypergraphs. In both mod

APA, Harvard, Vancouver, ISO, and other styles

8

Zhang, Xiaotong, Han Liu, Qimai Li, and Xiao-Ming Wu. "Attributed Graph Clustering via Adaptive Graph Convolution." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/601.

Full text

Abstract:

Attributed graph clustering is challenging as it requires joint modelling of graph structures and node attributes. Recent progress on graph convolutional networks has proved that graph convolution is effective in combining structural and content information, and several recent methods based on it have achieved promising clustering performance on some real attributed networks. However, there is limited understanding of how graph convolution affects clustering performance and how to properly use it to optimize performance for different graphs. Existing methods essentially use graph convolution o

APA, Harvard, Vancouver, ISO, and other styles

9

Sousa, Rita T., Sara Silva, and Catia Pesquita. "Explainable Representations for Relation Prediction in Knowledge Graphs." In 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/62.

Full text

Abstract:

Knowledge graphs represent real-world entities and their relations in a semantically-rich structure supported by ontologies. Exploring this data with machine learning methods often relies on knowledge graph embeddings, which produce latent representations of entities that preserve structural and local graph neighbourhood properties, but sacrifice explainability. However, in tasks such as link or relation prediction, understanding which specific features better explain a relation is crucial to support complex or critical applications. We propose SEEK, a novel approach for explainable representa

APA, Harvard, Vancouver, ISO, and other styles

10

"IMAGE MATCHING USING RELATIONAL GRAPH REPRESENTATION." In International Conference on Computer Graphics Theory and Applications. SciTePress - Science and and Technology Publications, 2006. http://dx.doi.org/10.5220/0001351704000406.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Relations with graph theory"

1

Sondheim, M., and C. Hodgson. Common hydrology features (CHyF) logical model. Natural Resources Canada/CMSS/Information Management, 2024. http://dx.doi.org/10.4095/328952.

Full text

Abstract:

The Open Geospatial Consortium has defined "OGC WaterML 2: Part 3 - Surface Hydrology Features (HY_Features) - Conceptual Model", but not any particular implementation of it. The Common Hydrology Features (CHyF) model extends HY_Features and makes some minor changes to it required for implementation and the delivery of high performance services. HY_Features discusses catchment coverage and topological relations. In CHyF these are key ideas, as is the notion that hydrologically defined network components form elements of a mathematical graph, allowing for very fast network traversal. HY_Feature

APA, Harvard, Vancouver, ISO, and other styles

2

Burch, Kimberly Jordan. Chemical Graph Theory. The MAA Mathematical Sciences Digital Library, 2008. http://dx.doi.org/10.4169/loci002857.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

GEORGIA INST OF TECH ATLANTA. Graph Minors: Structure Theory and Algorithms. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada266033.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Thomas, Robin. Graph Minors: Structure Theory and Algorithms. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada271851.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Obert, James, Sean D. Turner, and Jason Hamlet. Graph Theory and IC Component Design Analysis. Office of Scientific and Technical Information (OSTI), 2020. http://dx.doi.org/10.2172/1606298.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Sweeney, Matthew, and Emily Shinkle. Understanding Discrete Fracture Networks Through Spectral Graph Theory. Office of Scientific and Technical Information (OSTI), 2021. http://dx.doi.org/10.2172/1812641.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Sweeney, Matthew, and Emily Shinkle. Understanding Discrete Fracture Networks Through Spectral Graph Theory. Office of Scientific and Technical Information (OSTI), 2021. http://dx.doi.org/10.2172/1812622.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Shukla, Dr Minal. Exploring Graph Theory to Enhance Performance of Blockchain. ResearchHub Technologies, Inc., 2024. http://dx.doi.org/10.55277/researchhub.w5pebey6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Shukla, Dr Minal. Integrating Graph Theory for Consensus Mechanism of Blockchain Technology. ResearchHub Technologies, Inc., 2024. http://dx.doi.org/10.55277/researchhub.l34eqdoa.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Dixon, Lance. Perturbative Relations Between Gravity and Gauge Theory. Office of Scientific and Technical Information (OSTI), 1999. http://dx.doi.org/10.2172/802048.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!