Weighted graph

This paper studies the consensus problem in which agents interact via a matrix-weighted graph. The problem is considered with different assumptions on the agent's dynamical model (single-, double integrator) with uncertainty and on the interaction such as leaderless and leader-follower topologies.

9p vibranson 30-11-2023 6 4   Download

This paper proposes an improvement for two heuristic algorithms, PD-Steiner and SPT-Steiner, to solve a SMT problem in large size sparse graphs with edge weights not exceeding 10, and validates this proposal on large-size sparse graphs up to 100000 vertices. These experimental results are useful information for further research on the SMT problem.

10p visystrom 22-11-2023 3 3   Download

Ebook Algorithms in C: Part 2 includes contents: Chapter 24: elementary geometric methods, chapter 25: finding the convex hull, chapter 26: range searching, chapter 27: geometric intersection, chapter 28: closest-point problems, chapter 29: elementary graph algorithms, chapter 30: connectivity, chapter 31: weighted graphs, chapter 32: directed graphs, chapter 33: network flow, chapter 34: matching, chapter 35: random numbers, chapter 36: arithmetic, chapter 37: gaussian elimination, chapter 38: curve fitting, chapter 39: integration, chapter 40: parallel algorithms chapter 41: fast fourier ...

313p haojiubujain08 01-11-2023 3 1   Download

Continued part 1, part 2 of ebook "Coding theory and applications" provides readers with content including: on extendibility of additive code isometries; the extension theorem with respect to symmetrized weight compositions; minimal realizations of syndrome formers of a special class of 2D codes; shifted de bruijn graphs; new examples of non-abelian group codes; cyclic convolutional codes over separable extensions; reachability of random linear systems over finite fields;...

180p dieptieuung 19-07-2023 8 4   Download

The graph is a great mathematical tool, which has been effectively applied to many fields such as economy, informatics, communication, transportation, etc. It can be seen that in an ordinary graph the weights of edges and vertexes are taken into account independently where the length of a path is the sum of weights of the edges and the vertexes on this path.

7p vipatriciawoertz 31-05-2022 14 2   Download

Advanced Algorithms Analysis and Design - Lecture 21: Optimal weight triangulation. In this lecture we will cover the following: observations in dual graph; proof of lemmas; correspondence to binary trees; optimal substructure; computational cost; longest common subsequence problem; dynamic programming solution;...

29p andromedashun 26-05-2022 13 1   Download

Advanced Algorithms Analysis and Design - Lecture 28: Breadth first search. In this lecture we will cover the following: representation of graphs; breadth first search; supporting lemmas in the proof; proof of correctness; shortest paths, for un-weighted edges, based on breadth first search;...

40p andromedashun 26-05-2022 10 1   Download

Dijkstra’s algorithm is a simple greedy algorithm for computing the single-source shortest-paths to all other vertices. Dijkstra’s algorithm works on a weighted directed graph G = (V, E) in which all edge weights are non-negative, i.e., w(u, v) ≥ 0 for each edge (u, v) ∈ E. In this lecture, you find clear explanations of Dijkstra’s Algorithm.

23p youzhangjing_1909 28-04-2022 18 1   Download

Lecture Computer networks: Lesson 17 - Hammad Khalid Khan. The main topics covered in this chapter include: building routing tables, computing shortest path in a graph, weighted graph, distance metrics, distributed route computation, distance vector routing, vector-distance algorithm,...

22p youzhangjing_1909 28-04-2022 14 3   Download

Transcriptome assemblers aim to reconstruct full-length transcripts from RNA-seq data. We present TransComb, a genome-guided assembler developed based on a junction graph, weighted by a bin-packing strategy and pairedend information. A newly designed extension method based on weighted junction graphs can accurately extract paths representing expressed transcripts, whether they have low or high expression levels.

9p viaristotle 29-01-2022 12 0   Download

In this paper, we describe the structure of the cyclic module in the weighted Leavitt path algebra of reducible weighted graph generated by the elements in the induced graph. In module theory, the structure of a module or the structure of a submodule is commonly described.

5p viwilliamleiding 10-12-2021 10 1   Download

Lecture Data Structures and Algorithms - Chapter 12: Hash (Dr. Nguyen Ho Man Rang). After completing this section, you will understand knowledge about: A Graph G consists of a set V, whose members are called the vertices of G, together with a set E of pairs of distinct vertices from V; the pairs in E are called the edges of G; a graph is called connected if there is a path from any vertex to any other vertex;...

83p bachkhinhdaluu 03-12-2021 22 0   Download

Lecture Algorithms - Chapter 4.3: Minimum Spanning Trees. After studying this section will help you understand: introduction, greedy algorithm, edge-weighted graph API, Kruskal's algorithm, Prim's algorithm, context,...

65p gongyuefei 22-08-2021 15 1   Download

We study the area-minimizing property of slices in the weighted warped product manifold (R+ ×f Rn, e−ϕ), assuming that the density function e−ϕ and the warping function f satisfy some additional conditions. Based on a calibration argument, a slice {t0} × Gn is proved weighted areaminimizing in the class of all entire graphs satisfying a volume balance condition and some Bernstein type theorems in R+ ×f Gn and G+ ×f Gn, when f is constant, are obtained.

10p nguaconbaynhay11 07-04-2021 13 2   Download

In this paper, we will determine regularity of ideals associated with a complete graph in two weight. The value of this function depends on the structure of an associated simplex graph.

6p tamynhan9 02-12-2020 7 1   Download

Networks or graphs play an important role in the biological sciences. Protein interaction networks and metabolic networks support the understanding of basic cellular mechanisms. In the human brain, networks of functional or structural connectivity model the information-flow between cortex regions.

18p vioklahoma2711 19-11-2020 12 2   Download

Regulation mechanisms between miRNAs and genes are complicated. To accomplish a biological function, a miRNA may regulate multiple target genes, and similarly a target gene may be regulated by multiple miRNAs. Wet-lab knowledge of co-regulating miRNAs is limited.

12p vioklahoma2711 19-11-2020 6 1   Download

After studying this chapter you will be able to: define and calculate the mean, explain and calculate a weighted mean, define and calculate the median, define and identify the mode, prepare a frequency distribution, prepare bar, line, and circle graphs, calculate price relatives and cost comparisons, explain and calculate the range, define and calculate the standard deviation, estimate percentage of data by using standard deviations.

18p koxih_kothogmih10 26-10-2020 14 1   Download

An algorithm finding the shortest path joining two given vertices in an extended graph has been studied in other papers. In this paper, we show that the algorithm presented in doesn’t work for the extended graphs in. We define the other extended graph, called an extended weighted graph, such that a similar algorithm works for it.

8p tamynhan8 04-11-2020 9 1   Download

Gene action for various quantitative and qualitative traits was explored in a half diallel involving seven elite inbred lines. Variance/Co-variance graphs revealed that the yield potential traits like (days to 50% pollen shed, days to 75% brown husk, plant height ear placement height, ear length, kernel rows per ear, kernel per row, test weight and grain yield,) displayed that the intercept of the regression line was negative showing over dominance type of gene action.

7p chauchaungayxua8 03-10-2020 12 1   Download