Connected graphs

In this paper, we present VFFinder, a novel graph-based approach for automated silent vulnerability fix identification. To precisely capture the meaning of code changes, the changed code is represented in connection with the related unchanged code.

13p viambani 18-06-2024 3 1   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

Ebook "Graph databases" includes content: Introduction, options for storing connected data, data modeling with graphs, building a graph database application, graphs in the real world, graph database internals, predictive analysis with graph theory.

238p haojiubujain07 20-09-2023 6 3   Download

Ebook "Visualizing data" includes content: The seven stages of visualizing data, getting started with processing, mapping, time series, connections and correlations, scatterplot maps, trees, hierarchies, and recursion, networks and graphs, acquiring data, parsing data, integrating processing with java.

382p haojiubujain07 20-09-2023 7 3   Download

Part 1 of ebook "Arduino development cookbook" provides readers with contents including: chapter 1 - Power on – Arduino basics; chapter 2 - Blinking LEDs; chapter 3 - Working with buttons; chapter 4 - Sensors;...

121p tieulangtran 28-09-2023 8 4   Download

Continued part 1, part 2 of ebook "Graph databases: New opportunities for connected data" provides readers with contents including: chapter 5 - Graphs in the real world; chapter 6 - Graph database internals; chapter 7 - Predictive analysis with graph theory;

116p tieulangtran 28-09-2023 4 3   Download

Part 1 of ebook "Graph databases: New opportunities for connected data" provides readers with contents including: chapter 1 - Introduction; chapter 2 - Options for storing connected data; chapter 3 - Data modeling with graphs; chapter 4 - Building a graph database application;...

122p tieulangtran 28-09-2023 5 2   Download

(BQ) Ebook Graph theory and its applications (Second edition): Part 1 includes the following content: Chapter 1 introduction to graph models, chapter 2 structure and representation, chapter 3 trees, chapter 4 spanning trees, chapter 5 connectivity, chapter 6 optimal graph traversals, chapter 7 planarity and kuratowski’s theorem, chapter 8 drawing graphs and maps, chapter 9 graph colorings.

435p runordie6 10-08-2022 4 3   Download

In the paper, the author presented an algorithm for identifying hubs and authorities among potential web pages being relevant to a specified query. They said that a set of hubs and authorities is highly connected in comparison to the rest of the graph representing web pages.

5p vimelindagates 18-07-2022 6 2   Download

In the paper "A note on generalized rainbow connection of connected graphs and their number of EDGES", we first focus to improve the upper bound of the (1, l)-rainbow connection number depending on the size of connected graphs. Using this result, we characterize all connected graphs having the large (1, 2)-rainbow connection number. Moreover, we also determine the (1, l)-rainbow connection number in a connected graph G containing a sequence of cut-edges.

5p runordie3 27-06-2022 13 2   Download

Let G be an edge-colored graph. A path in G is a conflict-free path if it contains a color used on exactly one of its edges. The graph G is called conflict-free connected if every two distinct vertices is connected by at least one conflict-free path. The graph G is said to be properly edge colored (properly colored for simplifying), meaning an assignment of colors to edges so that no vertex is incident to two edges of the same color.

7p vimarissamayer 02-06-2022 14 1   Download

The main contents of this lecture include all of the following: Shortest Path, breadth-first search, traversing connected graphs, depth-first search, traversing connected graphs, generic graph traversal algorithm, breadth-first search.

25p youzhangjing_1909 28-04-2022 12 1   Download

This paper suggests a solution to multi-connectivity deployment WSN coverage based on combining Sailfish optimizer (SFO) with the characteristic of 3D surface topography. The target area divided into mesh grids of a size to establish the multiconnectivity of every grid. The cover set constructed through the direction gradient probabilistic model and connected graph and the joint points to graph within the grid by optimizing SFO.

9p linyanjun_2408 21-04-2022 11 3   Download

Single-cell RNA-seq quantifies biological heterogeneity across both discrete cell types and continuous cell transitions. Partition-based graph abstraction (PAGA) provides an interpretable graph-like map of the arising data manifold, based on estimating connectivity of manifold partitions (https://github.com/theislab/paga).

9p vigalileogalilei 27-02-2022 14 1   Download

Lecture Discrete Mathematics I - Chapter 9: More about graphs (Tran Vinh Tan) provide students with knowledge about connectivity, paths and circuits; euler and hamilton paths, euler paths and circuits, hamilton paths and circuits; shortest path problem, Dijkstra’s algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm, traveling salesman problem;...

294p bachnhuocdong 23-12-2021 15 0   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.1: Undirected Graphs. After studying this section will help you understand: introduction, graph API, depth-first search, breadth-first search, connected components, challenges,...

73p gongyuefei 22-08-2021 11 1   Download

This requires a data model that enables to easily represent the entities and support adding, deleting, and updating relations between entities without impacting application availability. Fortunately, graph databases are purposely-built to store highly connected data with nodes representing entities and edges representing relationships between these entities. In this paper, we propose a general graph model that can be used to design graph databases in order to support effectively storing and analyzing IoT data.

7p chauchaungayxua11 23-03-2021 10 2   Download

For a finite semigroup S and a nonempty subset A of S the Cayley Digraph of S with respect to A, denoted by Cay(S, A) is the directed graph with vertex set S and arc set {(s, sa) | s ∈ S and a ∈ A}. For digraph D, a directed path and a directed circuit which contain every vertex of D is called a Hamiltonian path and Hamiltonian circuit, respectively. In this paper, we obtain some necessary and sufficient conditions of S and A such that |A| ≤ 2 that Cay(S, A) contain a Hamiltonian circuit and a Hamiltonian path.

5p trinhthamhodang9 10-12-2020 25 1   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