underlying graph

underlying graph

[¦ən·dər‚lī·iŋ ′graf]
(mathematics)
A directed graph, that results from replacing each directed arc with an undirected edge.
References in periodicals archive ?
The site's underlying graph search feature allowed researchers to create open source tools, helping journalists and human rights organisations to find user-generated content and information about people in the public interest, which may otherwise go unreported.
A temporal graph consists of an underlying graph and a time-labeling function that assigns to every edge of the graph a set of discrete time-labels.
However, the underlying graph search capabilities are still available using second-party tools or Facebook URL hacks.
It was also discovered that those chart objects are automatically generated, incorporating rollover/hover "tooltip" captions with detail on the underlying graph data.
A signed graph is an ordered pair S = ([SIGMA], [sigma]), where [SIGMA] is a graph [SIGMA] = (V, E), called the underlying graph of S and [sigma] : E [right arrow] {+, -} is a function from the edge set E of [SIGMA] into the set {+, -}, called the signature (or sign in short) of S.
(2) Stronger privacy guarantee: we added an efficient algorithm to make the graph satisfy a strong privacy guarantee, differential privacy, and thus allow the app server to release the underlying graph of the entire social network without jeopardizing users' privacy.
A simple combinatorial characterization of Markov sources which satisfy this condition is given in terms of cycles of the underlying graph of the Markov chain.
These results coincide with our finding regarding to the random walk-based routing in social graphs, where the cost of routing over the different graphs is strongly related to the structure and connectivity of the underlying graph and loosely affected by the applied routing algorithm.
It is NP-complete to decide whether an undirected graph G is the underlying graph of an oriented clique.
Even through the relation (5.1) is established on the linearity, it is in fact truly for the linear and non-liner cases because the underlying graph of [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]-flow can be decomposed into bouquets and dipoles, hold with conditions of Theorem 4.2.
These scenarios consider WSN with complex settings such as a variety of sizes for the underlying graph, different node densities and transmission ranges, and the presence of obstacles.
Formally, a signed graph [GAMMA](G) = (G, [sigma]) consists of a simple graph G = (V, E) which is regarded as its underlying graph, and a mapping a : E [right arrow] {+, -}, the edge labeling.