Search results

...le usage of this notion is that any two [[core (graph theory)|core]]s of a graph are homomorphically equivalent. [[Category:Graph theory]] ...

In [[database]]s and specifically in [[graph database]]s, a '''regular path query'''<ref>{{Cite book |title=Answering re ...s just a [[regular expression]] over the set of labels. For instance, in a graph database where vertices represent users and there is an edge label "parent" ...

...rnal|last=Angles|first=Renzo|date=2012-04-01|title=A comparison of current graph database models|url=https://www.researchgate.net/publication/261076480|jour ...se [[vertex (graph theory)|vertices]] represent entities and [[Glossary of graph theory#arc|arcs]] represent relationships. Each arc has an identifier, a so ...

.... Given a hypergraph, we can define its ''primal graph'' as the undirected graph defined on the same set of vertices, in which we put an edge between any tw ...is conformal if, for every [[clique (graph theory)|clique]] of the primal graph, there is a hyperedge of ''H'' containing all the vertices of the clique. ...

==Ologs and databases== ...:\mathcal{D}\to \textbf{Set}</math> functors (see the section on ologs and databases) and <math>F:\mathcal{C}\to \mathcal{D}</math> a functor. <math>F</math> is ...

...n to the graph canonization problem, one could also solve the problem of [[graph isomorphism]]: to test whether two graphs ''G'' and ''H'' are isomorphic, c ...rm of a graph is an example of a [[Complete set of invariants|complete]] [[graph invariant]]: every two isomorphic graphs have the same canonical form, and ...

...the distribution whenever node set ''Z'' separates ''X'' from ''Y'' in the graph. Axioms for conditional independence in probability were derived earlier by ...nce between dependence and graphs was later extended to [[directed acyclic graph]]s (DAGs)<ref name=pearl:86>{{cite journal|last1=Pearl|first1=Judea|title=F ...

...f>{{Cite journal|title = EvoMiner: frequent subtree mining in phylogenetic databases|last1 = Deepak|first1 = Akshay|date = July 2013|journal = Knowledge and Inf ...ted as the number of trees in a database which have at least one subtree [[Graph isomorphism|isomorphic]] to a given pattern.<ref>Dai, H., Srikant, R. and Z ...

...ten a subtask for recommending items to users. In the curation of citation databases, it can be used for record deduplication. In bioinformatics, it has been us Here, the graph is represented as an adjacency matrix with missing values. ...

{{short description|API for graph data and graph operations}} | domain = Graph algorithms ...

{{Short description|Database using graph structures for queries}} ...m|first2=Seon-Kyu|last3=Kim|first3=Seon-Young|date=March 2017|title=Use of Graph Database for the Integration of Heterogeneous Biological Data|journal=Genom ...

...tex of that set. It is an extension of the notion of [[vertex cover]] in a graph.<ref name="lp2">{{Cite Lovasz Plummer}}</ref>{{rp|466–470}}<ref>{{Cite book ...blem]]: An instance of set cover can be viewed as an arbitrary [[bipartite graph]], with sets represented by vertices on the left, elements of the universe ...

...s known that the problem of evaluating conjunctive queries on [[relational databases]] is equivalent to the [[constraint satisfaction problem]]<ref>{{Cite journ ...

* Point pages: A collection of ''(point, location)'' pairs. In the case of databases, ''location'' may point to the index of the database record, while for poin * The graph is a multi-way tree. Region pages always point to child pages, and can not ...

...nation]]s (also called Kidney Exchange Programs). Such programs have large databases of patient-donor pairs, where the donor is willing to donate a kidney in or ...ar [[antigen]]s in their blood). A [[directed cycle]] in the compatibility graph represents a possible exchange. A directed cycle of size 2 (e.g. A -> B -> ...

...ding on whether the change eventually reaches the element). The dependency graph may need to be updated as dependencies change, or as elements are added to, With cycles in the dependency graph, a single pass through the graph may not be sufficient to reach a fixed point. In some cases, complete reeva ...

...ce), but at some point the marginal gain will drop, giving an angle in the graph. The number of clusters is chosen at this point, hence the "elbow criterion ...roken line method. The broken line method identifies the jump point in the graph of the transformed distortion by doing a simple [[least squares]] error lin ...

{{Short description|Type of Knowledge Graph Management System}} ...or performing complex [[Inference|logic reasoning tasks]] over [[knowledge graph]]s. Its language is based on an extension of the rule-based language [[Data ...

...ich is the problem of determining whether a [[Graph (discrete mathematics)|graph]] <math>G=(V,E)</math> has a [[Hamiltonian cycle]]. ...iltonian cycle or not. Searching through all the possible orderings of the graph's vertices can be done with quantum counting followed by Grover's algorithm ...

...nt set (graph theory)|independent set]]s in [[Graph (discrete mathematics)|graph]]s. ...=2011 |url=https://doi.org/10.1007/978-3-031-01879-4_3 |work=Probabilistic Databases |pages=45–52 |editor-last=Suciu |editor-first=Dan |access-date=2023-09-16 | ...