undirected graph
LexPageRank: Prestige in Multi Document Text Summarization
... In a cluster of related documents, many of the sen- tences are expected to be somewhat similar to each other since they are all about the same topic. This can be seen in Figure 1 where the majority of the values in the ...
7
Balanced Decomposition of Hypercube
... Let G be an undirected graph with no multiple edge or loop. Let V G and E G be the vertex set and edge set of G .A balanced vertex coloring of G is a pair R, B of subsets R , B V G such ...
5
algorithmic-mobihoc02.pdf
... directed graph model studied in ...an undirected graph in the following ...directed graph model for the network is ...single undirected edge {u, v} ...resulting undirected ...
12
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
... an undirected graph is given as a structural ...this undirected graph as a super-structure; the skeleton of every graph considered is compelled to be a subgraph of the ...
26
A Note on a graph associated to a commutative ring
... a graph with certain subsets of a ring and investigated the interplay between the ring-theoretic properties of a ring and the graph- theoretic properties of the graph associated with it (See for ...
22
SRC RR 32 pdf
... of undirected st-connectivity [6] (Given an undirected graph G and two specied vertices s and t in G , determine if there is a path connecting s and t ...and graph theory that motivate the ...
23
Reconstructing Undirected Graphs from Eigenspaces
... We aim at recovering the weighted adjacency matrix W of an undirected graph from a per- turbed version of its eigenspaces. This situation arises for instance when working with sta- tionary signals on graphs ...
24
A Graph Based Method to Mine Frequent Dense Resources across Multiple Discrete Value Function Resource Effectiveness Matrix
... and undirected graph, where each resource is represented by one node and two resources are connected with an edge if their sampling values show the same specified trend (See definition ...
9
Pseudo Multi hop Distributed Consensus Algorithm with Link Failure
... then graph G ( V , E ) is balanced, an undirected graph G ( V , E ) is ...A graph is connected if any two vertices in the graph can be joined by a ...A graph G 2 ( V , E 2 ...
5
Neighbourhood Edge Product Cordial And Total Neighbourhood Edge Product Cordial Labeling Of Graphs
... a graph G, we mean a finite, connected, undirected graph without loops and multiple edges, suppose graph G is disconnected means each component of G must contain at least one edge, for terms ...
8
Computing Chemical Properties of Molecules by Graphs and Rank Polynomials
... a graph G is a numeric quantity related to G which is invariant under automorphisms of ...every undirected graph contains information about connectivity of the ...a graph are polynomials in ...
7
Review of a Connected Graph Using Prim's Algorithm to Find a Minimum Spanning Tree
... an undirected graph G is a sub graph that is a tree, which Includes all of the vertices of G, with minimum possible number of edges ...weight undirected graph that connects all the ...
8
Adaptive Neural Network Method for Consensus Tracking of High-Order Mimo Nonlinear Multi-Agent Systems
... Consensus of networked agents with linear dynamics is broadly developed for various points of view [1-8]. However, in practice, dynamics of most physical systems are nonlinear and distributed control of such systems is ...
11
A New Approach for Clustering of Navigation Patterns of Online Users
... the graph partitioning for modeling user Navigation ...an undirected graph based on connectivity between Referrer and URI ...the undirected graph ...
7
A Graphical Representation of Equivalence Classes of AMP Chain Graphs
... chain graph” makes no ...essential graph. Every arrow in the AMP essential graph is either an arrow with the same direction or an undirected edge in every chain graph from the ...
34
A New Quick Algorithm for Finding the Minimal Spanning Tree
... a graph beginning with any node of the ...edge-weighted undirected graph that connects all the vertices together, without any cycles or loops and with the minimum possible total edge ...single ...
9
Finding 3-edge-connected components in parallel
... A parallel algorithm for finding 3-edge-connected components of an undirected graph.. on a CRCW PRAM is presented.[r] ...
58
keyword extraction from a single document using centrality measures PREMI2007
... an undirected graph, whose vertices are words in the document and the edges are labeled with a dissimilarity measure between two words, derived from the freuqnecy of their co-occurrence in the ...this ...
8
Computing the additive degree-Kirchhoff index with the Laplacian matrix
... For any simple connected undirected graph, it is well known that the Kirchhoff and multiplicative degree–Kirchhoff indices can be computed using the Laplacian matrix. We show that the same is true for the ...
6
Application of Centrality Principles for Terrorist Network Role Analysis
... Sarita Azad and Arvind Gupta tried to quantitatively assess 26/11 Mumbai attacks. The author explained how Social Network Analysis can be used as an effective Network Analysis tool. During their research they examined ...
6