Search results for " Graph theory"

Motives for reflections. Part one

2013

Facsimile of manuscript from the archive of Emanuels Grinbergs, University of Latvia. The article (in three pieces of manuscripts), written in Russian, contains some reflections on graph theory. It may be written in 1973.

Motives for reflections Addendum to part one

2013

The article (in three pieces of manuscripts), written in Russian, contains some reflections on graph theory. It may be written in 1973.

On threeconnected graphs with unique Hamiltonian cycle = О трехсвязный графах ...

2013

Geodesic graphs

2013

In the article, written in Russian, geodesic graphs, graphs with unique shortest path between every two vertices, are considered. Geodesic graphs are trees, odd cycles, and nontrivial example, the graph of Petersen. The article is dated 21.11.74.

Motives for reflections. Part two

2013

E. Gringergs archive manuscripts may be found in the Library of the University of Latvia under https://lira.lanet.lv/F/98QNED45E7J5HDUHLY51HV43QNRX97XCQJPHQ9S6L7HX4FABFB-10883?func=find-b&request=E.Grinberga&find_code=TIT&x=32&y=13&filter_code_1=WLN&filter_request_1=&filter_code_2=WYR&filter_request_2=&filter_code_3=WYR&filter_request_3=&filter_code_4=WFM&filter_request_4=

Biased graph walks for RDF graph embeddings

2017

Knowledge Graphs have been recognized as a valuable source for background information in many data mining, information retrieval, natural language processing, and knowledge extraction tasks. However, obtaining a suitable feature vector representation from RDF graphs is a challenging task. In this paper, we extend the RDF2Vec approach, which leverages language modeling techniques for unsupervised feature extraction from sequences of entities. We generate sequences by exploiting local information from graph substructures, harvested by graph walks, and learn latent numerical representations of entities in RDF graphs. We extend the way we compute feature vector representations by comparing twel…