Aim at the potential that the time efficiency of the technology of Cycle elimination for invocation graph-based context-sensitive pointer analysis can be improved. Through using wave and deep propagation method, which is the state-of-the-art techniques of Inclusion Based Pointer Analysis on-line optimization Technology, to optimize the technology of cycle elimination for invocation graph-based ...

GXL provides an international standard to exchange graphs and their according schemas, but without offering means to visualize these structures. This paper presents a declarative approach to specify a graph layout by referring to the graphs schema. Using GReQL graph querying technology, the resulting display of graph elements can be influenced by various graph properties. The graph visualizer G...

‎let $d_{n,m}=big[frac{2n+1-sqrt{17+8(m-n)}}{2}big]$ and‎ ‎$e_{n,m}$ be the graph obtained from a path‎ ‎$p_{d_{n,m}+1}=v_0v_1 cdots v_{d_{n,m}}$ by joining each vertex of‎ ‎$k_{n-d_{n,m}-1}$ to $v_{d_{n,m}}$ and $v_{d_{n,m}-1}$‎, ‎and by‎ ‎joining $m-n+1-{n-d_{n,m}choose 2}$ vertices of $k_{n-d_{n,m}-1}$‎ ‎to $v_{d_{n,m}-2}$‎. ‎zhang‎, ‎liu and zhou [on the maximal eccentric‎ ‎connectivity ind...

the order graph of a group $g$, denoted by $gamma^*(g)$, is a graph whose vertices are subgroups of $g$ and two distinct vertices $h$ and $k$ are adjacent if and only if $|h|big{|}|k|$ or $|k|big{|}|h|$. in this paper, we study the connectivity and diameter of this  graph. also we give a relation between the order graph and prime  graph of a group.

let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...

in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.

Graph databases have emerged as the fundamental technology underpinning trendy application domains where traditional databases are not well-equipped to handle complex graph data. However, current graph databases support basic graph structures and integrity constraints with no standard algebra. In this paper, we introduce GRAD, a native and generic graph database model. GRAD goes beyond traditio...

There are several applications in VLSI technology that require high-speed shortest-path computations. The shortest path is a path between two nodes (or points) in a graph such that the sum of the weights of its constituent edges is minimum. Floyd-Warshall algorithm provides fastest computation of shortest path between all pair of nodes present in the graph. With rapid advances in VLSI technolog...