Results 1 to 10 of about 35,359 (261)
Some of the next articles are maybe not open access.
On the Complexity of a Linear Ordering of Weighted Directed Acyclic Graphs
Moscow University Mathematics Bulletin, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shchekalev, M. I. +2 more
openaire +2 more sources
Finding popular branchings in vertex-weighted directed graphs
Theoretical Computer Science, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kei Natsui, Kenjiro Takazawa
openaire +1 more source
Subgraph Mining on Directed and Weighted Graphs
2010Subgraph mining algorithms aim at the detection of dense clusters in a graph In recent years many graph clustering methods have been presented Most of the algorithms focus on undirected or unweighted graphs In this work, we propose a novel model to determine the interesting subgraphs also for directed and weighted graphs We use the method of density ...
Stephan Günnemann, Thomas Seidl 0001
openaire +1 more source
Neural Network for Routing in a Directed and Weighted Graph
2008 Eighth International Conference on Intelligent Systems Design and Applications, 2008In this paper, we use a neural network based algorithm to find the best path in a directed and weighted graph. In this algorithm, we define a suitable energy function; the minimum of this function correspond to the best path. By using gradient descent method, the energy is minimized at the convergence of neural network.
Mehran Ghaziasgar, Armin Tavakoli Naeini
openaire +1 more source
Dynamic consensus estimation of weighted average on directed graphs
International Journal of Systems Science, 2013Recent applications call for distributed weighted average estimation over sensor networks, where sensor measurement accuracy or environmental conditions need to be taken into consideration in the final consensused group decision. In this paper, we propose new dynamic consensus filter design to distributed estimate weighted average of sensors’ inputs on
Shuai Li, Yi Guo 0004
openaire +1 more source
Some Decision Problems Associated with Weighted, Directed Graphs
SIAM Journal on Applied Mathematics, 1966This paper is concerned with finite, directed, weighted, linear graphs. Two such graphs are said to be “equivalent” if every weight-equence appearing in one also appears in the other. It is proved (constructively) that an algorithm exists for deciding whether or not two graphs are equivalent.
Deuel, D. R., Gill, A.
openaire +1 more source
On Computing the Diameter of Real-World Directed (Weighted) Graphs
2012In this paper we propose a new algorithm for computing the diameter of directed unweighted graphs. Even though, in the worst case, this algorithm has complexity O(nm), where n is the number of nodes and m is the number of edges of the graph, we experimentally show that in practice our method works in O(m) time.
CRESCENZI, PIERLUIGI +3 more
openaire +3 more sources
Weighted and Directed Graph Approaches
2018It is interesting to look at the types of social networks that are directed or weighted, or social networks with the combination of both. In many cases, the relationship between vertices may be quantifiable (weighted) or asymmetrical (directed).
openaire +1 more source
Graph autoencoder for directed weighted network
Soft Computing, 2021Yang Ma +5 more
openaire +1 more source
A Novel Subgraph Querying Method on Directed Weighted Graphs
2018 14th International Conference on Computational Intelligence and Security (CIS), 2018The usage of graphs has led to the emergence of schema queries in knowledge graph and graph databases, where subgraph queries have become one of the most important research problems. In this paper, we study the directed weighted graphs, and propose a subgraph querying method NGraph based on shortest weight paths. Specifically, we extract three features:
Wei Wang +4 more
openaire +1 more source