Results 141 to 150 of about 1,011,259 (278)

Omni Geometry Representation Learning Versus Large Language Models for Geospatial Entity Resolution

open access: yesTransactions in GIS, Volume 30, Issue 1, February 2026.
ABSTRACT The development, integration, and maintenance of geospatial databases rely heavily on efficient and accurate matching procedures of Geospatial Entity Resolution (ER). While resolution of points‐of‐interest (POIs) has been widely addressed, resolution of entities with diverse geometries has been largely overlooked.
Kalana Wijegunarathna   +2 more
wiley   +1 more source

A note on star coloring of central graph of bipartite graph and corona graph of complete graph with path and cycle [PDF]

open access: yesTransactions on Combinatorics, 2012
In this paper, we find the star chromatic number of central graph of complete bipartite graph and corona graph of complete graph with path and cycle.
V. J. Vernold, M. Venkatachalam
doaj  

Annihilating Graph of Abelian Groups

open access: yesپژوهش‌های ریاضی, 2021
In [18], the author associated a graph to an R -module M which is precisely a generalization of annihilating ideal graph of a commutative ring, see [15] and [16]. Inasmuch as Abelian groups are precisely Z-modules, in this paper we relate an annihilating
saeed safaeeyan, Soraya Barzegar
doaj  

Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm. [PDF]

open access: yesFront Pharmacol, 2022
Kusuma WA   +6 more
europepmc   +1 more source

Computing the permanental polynomial of 4k-intercyclic bipartite graphs

open access: yesThe American Journal of Combinatorics
Let \(G\) be a bipartite graph with adjacency matrix \(A(G)\). The characteristic polynomial \(\phi(G,x)=\det(xI-A(G))\) and the permanental polynomial \(\pi(G,x) = \operatorname{per}(xI-A(G))\) are both graph invariants used to distinguish graphs.
Ravindra Bapat   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy