Dynamic graph
Communication-Optimal Distributed Dynamic Graph Clustering
... Dynamic Graph Streams. When the graph update stream observed at each site is a fully dynamic stream containing a small number of node/edge deletions, we present a simple trick which enables ...
8
Kernelization via sampling with applications to dynamic graph streams
... • Vertex Cover and Hitting Set: There exists an O(k ˜ d ) space algorithm that solves the minimum hitting set problem where d is the cardinality of the input sets and k is an upper bound on the size of the minimum ...
20
Matroid structure of dynamic graph model of evaporation process in a boiler system
... Applications of this concept are explored in modeling the clinical waste incineration process and combustion process in a circulating fluidized bed boiler (Sumarni et al., 2013; Tahir et al., 2010). In a typical oxy-fuel ...
22
Transportation, Germs, Culture: A Dynamic Graph Model of 2019-nCoV Spread
... dynamic graph model of contagious disease outbreak. B. Spreading patterns when asymptomatic transmission is present or absent. C. The impact of various lengths of asymptomatic periods on virus spread. D. ...
6
The power of vertex sparsifiers in dynamic graph algorithms
... by utilizing a tool called vertex sparsification as well as the structure of minor-free graphs. Vertex sparsification is a way of compressing large graphs into smaller ones that well preserve the relevant properties ...
15
A Scalable Graph-Coarsening Based Index for Dynamic Graph Databases
... as graph database D. To speed up query answering on graph databases, indexes are commonly ...State-of-the-art graph database indexes do not adapt or scale well to dynamic graph database ...
83
Mind Economy: Dynamic Graph Analysis of Communications
... In order to see whether the influence hierarchy is random or not, we simulate many parallel worlds where users talk to each other based on various global and local optimization criteria. Some of these criteria are simple, ...
236
Comparative Analysis of Dynamic Graph Techniques and Data Structure
... Dynamic graph algorithm handle the graph problems, where the graph undergoes the series of updates including the insertion of an edge and deletion of an edge and answers the various queries ...
6
Runtime analysis of randomized search heuristics for dynamic graph coloring
... consider graph coloring, a classical NP-hard optimization ...a dynamic change has happened. Dynamic algorithms have been proposed to maintain proper coloring for graphs with maximum degree at most ∆ ...
10
Dynamic graph stream algorithms in o(n) space
... deciding graph prop- erties. Given a huge graph, it is very useful to know whether the graph has some predetermined property, such as k-connectivity, bipartiteness, cycle-freeness and ...highly ...
24
Dynamic graph based search in unknown environments
... From a theoretical point of view, our method, to a certain extent, repre- sents a fusion and further development of strategies proposed in [16] and [15]. One crucial difference is that movements of the robots in our ...
20
Dynamic graph based search in unknown environments
... networks. Graph theory facilitates analysis of the interplay between the communications network and robot dynamics, and to choose strategies for information exchange which mitigate these ...
25
Research on Similarity Nodes Query Algorithm ...
... of dynamic graph topology, in order to quantify the change of the change of the relation between the nodes within a certain time, a concept, namely ubiquitous similarity node, was defined, and the level of ...
12
Dynamic algorithms for graph coloring
... static graph G = (V, E), there seems to be no obvious way to assign a level `(v) ∈ {1, ...a dynamic graph. Initially, when the input graph G = (V, E) has an empty edge-set, we place every ...
21
Multi-Objective Pathfinding in Dynamic Environments
... 16 ignoring any recomputation required to those specific cells. A secondary value in addition to the primary cost value of each node is maintained, known as the rhs-value which is derived from a DynamicSWSF-FP algorithm. ...
114
Modeling the Connections of Dynamic Sensor Fields Based on BT-Graph
... a dynamic sensor field should be presented by a graph-based model because it is convenient to determine number of neighbors in the satellite’s communication range and then apply the optimization ...namely ...
9
Congestion Control in Multi-Flow Environment Using Multipath Routing Base in MANET
... The number of routing packets flooded in network for connection establishment and confirmation through sender and receiver in network are measured through routing load performance parameter. The less number of routing ...
6
Dynamic Spatial-Temporal Graph Convolutional Neural Networks for Traffic Forecasting
... Previous studies on traffic forecasting with GCNN (Yu, Yin, and Zhu 2017a; Yao et al. 2018; Puy, Kitic, and P´erez 2017) have a fatal drawback. They seldom consider the change of spatial dependencies with the gradual ...
8
Regular number of line block graph of a graph
... set of non-end vertices which are cut vertices in . Suppose every vertex of is adjacent to atleast one end vertex. Then is a -set of . Suppose deg( ) > deg( ) > deg( ) > . . . > deg( ). Then in Lb( ), ∀ ∈ ...
6
Vol 6, No 8 (2015)
... Definition: 1.2 Let f: V(G) → {1,2,…,p+q} be an injective function. For a vertex labeling “f”, the induced edge labeling f*(e=uv) is defined by, f* (e) = ��𝑓𝑓(𝑢𝑢)𝑓𝑓(𝑣𝑣) � or ��𝑓𝑓(𝑢𝑢)𝑓𝑓(𝑣𝑣)� . Then “ f ” is called a ...
15