Results 271 to 280 of about 22,888 (290)
Some of the next articles are maybe not open access.
Max-Balancing Weighted Directed Graphs and Matrix Scaling
Mathematics of Operations Research, 1991A weighted directed graph G is a triple (V, A, g) where (V, A) is a directed graph and g is an arbitrary real-valued function defined on the arc set A. Let G be a strongly-connected, simple weighted directed graph. We say that G is max-balanced if for every nontrivial subset of the vertices W, the maximum weight over arcs leaving W equals the maximum ...
Michael H Schneider
exaly +2 more sources
Packing rooted directed cuts in a weighted directed graph
Mathematical Programming, 1974A simple algorithm is described for constructing a maximum packing of cuts directed away from a distinguished vertex, called the root, in a directed graph, each of whose edges has a nonnegative weight, and it is shown that the maximum packing value is equal to the weight of a minimum-weight spanning arborescence directed away from the root.
openaire +2 more sources
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
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:
Xinhong Hei, Yichuan Wang
exaly +2 more sources
Optimal Kalman Consensus Filter for Weighted Directed Graphs
2019 IEEE 58th Conference on Decision and Control (CDC), 2019The distributed estimation problem has proven to be a highly relevant topic today, due to its applicability in a wide variety of scenarios that do not accommodate a centralized supervisor. Decentralized algorithms can offer enhanced robustness and resilience to system failures and cyber-attacks.
Shiraz Khan +2 more
openaire +1 more source
Fast Approximated Betweenness Centrality of Directed and Weighted Graphs
2018Node betweenness centrality is a reference metric to identify the most critical spots of a network. However, its exact computation exhibits already high (time) complexity on unweighted, undirected graphs. In some domains such as transportation, weighted and directed graphs can provide more realistic modeling, but at the cost of an additional ...
Angelo Furno +3 more
openaire +1 more source
Clustering by weighted cuts in directed graphs
Proceedings of the 2007 SIAM International Conference on Data Mining, 2007Marina Meila, William Pentney
openaire +1 more source