Results 21 to 30 of about 121,460 (194)
A Note on the PageRank of Undirected Graphs [PDF]
The PageRank is a widely used scoring function of networks in general and of the World Wide Web graph in particular. The PageRank is defined for directed graphs, but in some special cases applications for undirected graphs occur.
Abbassi +14 more
core +1 more source
Quantitation of Vascular Morphology by Directed Graph Construction
The quantitation of morphology information of X-ray angiography image has an important value in the diagnosis of coronary artery disease. This paper proposes an automatic morphology estimation method by using directed graph construction for X-ray ...
Jingliang Zhao +5 more
doaj +1 more source
The Wiener, hyper-Wiener, Harary and SK indices of the P(Z_{p^k.q^r}) power graph [PDF]
The undirected P(Zₙ) power graph of a finite group of Zₙ is a connected graph, the set of vertices of which is Zₙ. Here u,v∈P(Zₙ) are two diverse adjacent vertices if and only if u≠v and ⟨v⟩ ⊆ ⟨u⟩ or ⟨u⟩ ⊆ ⟨v⟩.
Volkan Aşkin
doaj +1 more source
Iterative Algorithm for Finding the Shortest Ways in an Unweighted Undirected Graph
There is a problem of finding the shortest paths between two vertices in an unweighted, undirected graph, which is aggravated by the fact that the available algorithms for finding all paths have a complexity of at least .
Valentin Sysoev
doaj +1 more source
Lucas Gracefulness of Almost and Nearly for Some Graphs [PDF]
By a graph, we mean a finite undirected graph without loops or multiple ...
Nagarajan, A. +2 more
core +1 more source
Sample compression schemes were first proposed by Littlestone and Warmuth in 1986. Undirected graphical model is a powerful tool for classification in statistical learning.
Tingting Luo, Benchong Li
doaj +1 more source
Evolutionary regime transitions in structured populations. [PDF]
The evolutionary dynamics of a finite population where resident individuals are replaced by mutant ones depends on its spatial structure. Usually, the population adopts the form of an undirected graph where the place occupied by each individual is ...
Fernando Alcalde Cuesta +2 more
doaj +1 more source
Simple Undirected Graphs as Formal Contexts [PDF]
The adjacency matrix of a graph is interpreted as a formal context. Then, the counterpart of Formal Concept Analysis (FCA) tools are introduced in graph theory. Moreover, a formal context is seen as a Boolean information table, the structure at the basis of Rough Set Theory (RST). Hence, we also apply RST tools to graphs.
Giampiero Chiaselotti +2 more
openaire +2 more sources
Enumerating Cyclic Orientations of a Graph [PDF]
Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set; it is cyclic ...
A Itai +11 more
core +4 more sources
Reputation games for undirected graphs
J. Hopcroft and D. Sheldon originally introduced network reputation games to investigate the self-interested behavior of web authors who want to maximize their PageRank on a directed web graph by choosing their outlinks in a game theoretic manner. They give best response strategies for each player and characterize properties of web graphs which are ...
Avis, David, Iwama, Kazuo, Paku, Daichi
openaire +2 more sources

