Test sequence generation through code is mainly done by using some sort of a flow graph viz. Control Flow Graph (CFG), Concurrent Control Flow Graph (CCFG), event Graph etc. approaches that use UmL also need flow graph as an intermediate representation for final test sequence generation. In the present approach, a Flow Graph for a new concept i.e. Java7 Fork/Join is constructed and hence, by tr...

The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...

A join in a graph is a set F of edges such that for every circuit C, |C ∩ F | ≤ |C \ F |. We study the problem of finding a connected join covering a given subset of vertices of the graph, that is a Steiner tree which is a join at the same time. This turns out to contain the question of finding a T -join of minimum cardinality (or weight) which is, in addition, connected. This last problem is m...

Subgraph enumeration aims to find all the subgraphs of a large data graph that are isomorphic to a given pattern graph. As the subgraph isomorphism operation is computationally intensive, researchers have recently focused on solving this problem in distributed environments, such as MapReduce and Pregel. Among them, the state-of-the-art algorithm, TwinTwigJoin, is proven to be instance optimal b...

In the graph database literature the term “join” does not refer to an operator combining two graphs, but involves path traversal queries over a single graph. Current languages express binary joins through the combination of path traversal queries with graph creation operations. Such solution proves to be not efficient. In this paper we introduce a binary graph join operator and a corresponding ...

The distance $d(u,v)$ between two vertices $u$ and $v$ of a graph $G$ is equal to the length of a shortest path that connects $u$ and $v$. Define $WW(G,x) = 1/2sum_{{ a,b } subseteq V(G)}x^{d(a,b) + d^2(a,b)}$, where $d(G)$ is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are compu...

Existing MapReduce systems support relational style join operators which translate multi-join query plans into several Map-Reduce cycles. This leads to high I/O and communication costs due to the multiple data transfer steps between map and reduce phases. SPARQL graph pattern matching is dominated by join operations, and is unlikely to be efficiently processed using existing techniques. This co...

The information in many applications can be naturally represented as graph-structured XML document. Structural query on graph structured XML document matches the subgraph of graph structured XML document on some given schema. The query processing of graphstructured XML document brings new challenges. In this paper, for the processing of subgraph query, we design a subgraph join algorithm based ...