• No results found

Directed graph

Synchronizing Coloring Of A Directed Graph

Synchronizing Coloring Of A Directed Graph

... Abstract —A synchronizing of a deterministic au- tomaton is a word in the alphabet of colors ( consid- ered as letters ) of its edges that maps the automaton to a single state. A coloring of edges of a directed ...

5

Attractors of directed graph IFSs that are not standard IFS attractors and their Hausdorff measure

Attractors of directed graph IFSs that are not standard IFS attractors and their Hausdorff measure

... most directed graph IFSs produce genuinely new fractals, with many 3-vertex IFSs having attractors that cannot be the attractors of 1 or 2-vertex IFSs and so ...

27

Enhancing performance and expressibility of complex event processing using binary tree-based directed graph

Enhancing performance and expressibility of complex event processing using binary tree-based directed graph

... Chapter 4 presents the proposed structure to manage process through transformation of user-defined queries into binary tree-based directed graph. This structure is used as a basis to perform event marching ...

44

Crash-tolerant  Consensus  in  Directed  Graph  Revisited

Crash-tolerant Consensus in Directed Graph Revisited

... The protocols of [14] are significantly different from the traditional consensus protocols developed for undirected graphs. Specially they belong to a special class of consensus protocols, based on “flooding”. In more ...

24

Performance on Coupled Network in Node Unbiased Level Raise To Unprejudiced Network– Directed Graph Approach

Performance on Coupled Network in Node Unbiased Level Raise To Unprejudiced Network– Directed Graph Approach

... Performance on Coupled Network in Node Unbiased Level Raise To Unprejudiced Network – Directed Graph Approach A is called single source out node, B&C are Bypass node or transit node D is[r] ...

6

New results on coupled fixed point theory in metric spaces endowed with a directed graph

New results on coupled fixed point theory in metric spaces endowed with a directed graph

... Let (X, d) be a metric space and be the diagonal of X × X. Let G be a directed graph, such that the set V (G) of its vertices coincides with X and ⊆ E(G), where E(G) is the set of the edges of the ...

13

ATP: Directed Graph Embedding with Asymmetric Transitivity Preservation

ATP: Directed Graph Embedding with Asymmetric Transitivity Preservation

... of directed graphs, since it can play an impor- tant role in downstream graph inference and ...the graph to a lower dimensional vector embed- ding space, has been the focus of much recent ...of ...

8

Commutants of weighted shift directed graph operator algebras

Commutants of weighted shift directed graph operator algebras

... contemporary directed graph operator algebra frame- ...vertex directed graphs gave sufficient conditions for the determination of the commu- tant and for reflexivity [7], the basic general goals ...

18

Fixed point results for set-contractions on metric spaces with a directed graph

Fixed point results for set-contractions on metric spaces with a directed graph

... a directed graph G has no parallel edge and G is a weighted graph in the sense that each vertex x is assigned the weight d(x, x) =  and each edge (x, y) is assigned the weight d(x, ...

9

Common coupled fixed point theorems for θ-ψ-contraction mappings endowed with a directed graph

Common coupled fixed point theorems for θ-ψ-contraction mappings endowed with a directed graph

... In this paper, we present some existence and uniqueness results for coupled coincidence point and common fixed point of θ - ψ -contraction mappings in complete metric spaces endowed with a directed graph. ...

11

A Semi Supervised Method for Arabic Word Sense Disambiguation Using a Weighted Directed Graph

A Semi Supervised Method for Arabic Word Sense Disambiguation Using a Weighted Directed Graph

... In this paper, we propose a new semi- supervised approach for Arabic word sense disambiguation. Using the corpus and Arabic Wordnet 1 , we define a method to cluster the sentences containing ambiguous words. For each ...

5

Directed graph iterated function systems

Directed graph iterated function systems

... a directed graph IFS as opposed to a standard IFS?” A standard IFS can always be represented as a 1-vertex directed graph IFS so the question is really, “Do we get anything new with a ...

161

3. Common Fixed Point Theorems for Multivalued Mappings on Metric Spaces with a Directed Graph

3. Common Fixed Point Theorems for Multivalued Mappings on Metric Spaces with a Directed Graph

... a directed graph such that the set V (G) of its vertices coincides with X and E(G) be the set of edges of the graph which contains all loops, that is, ∆ ⊆ ...the graph G has no parallel edges ...

12

Chemical equation representation as directed graph

Chemical equation representation as directed graph

... We now describe the method of constructing a directed graph. Vertices – Number of vertices in G = Number of chemical elements in the equation. In our example the chemical elements are C, H, O. So the number ...

7

Estimating and visualizing language similarities using weighted alignment and force directed graph layout

Estimating and visualizing language similarities using weighted alignment and force directed graph layout

... This paper investigates two issues, that are related to the two topics of the workshop respectively: • Which similarity measures over language pairs based on the ASJP data are apt to sup[r] ...

8

Limit theorems for a random directed slab graph

Limit theorems for a random directed slab graph

... i ∨ j. The directed graph thus obtained is precisely the restriction of our graph on the set { 1, . . . , n } . This model was also studied in [18]. In this paper, we obtained, among other things, ...

26

Graph parsing with s graph grammars

Graph parsing with s graph grammars

... two graph parsing algorithms (top- down and bottom-up) for s-graph ...S- graph grammars are equivalent to HRGs, but em- ploy a more fine-grained perspective on graph- combining ...the ...

10

An Efficient Technique for Multipath Routing Based on Directed Acyclic Graph (DAG) Amit Sawanni, Diamond Jonawal

An Efficient Technique for Multipath Routing Based on Directed Acyclic Graph (DAG) Amit Sawanni, Diamond Jonawal

... N. Niharika et al [2] have presented the thought for attaining resilient multipath routing with the help of Independent Directed Acyclic Graphs (IDAGs). In this paper, the suggested procedure has attains multipath ...

7

Topics in graph colouring and graph structures

Topics in graph colouring and graph structures

... a graph on n vertices containing o(n 3 ) triangles can be made triangle- free by the removal of o(n 2 ) edges (where we say that a graph G contains k copies of a graph H if G has, as subgraphs, k ...

292

A Study on the Inj Equitable Graph of a Graph

A Study on the Inj Equitable Graph of a Graph

... Definition 19 Let G = ( V E , ) be a graph . A subset D of V is called degree Inj-equitable set if the difference between the injective degree of any two vertices in D less then or equal one . The maximum ...

10

Show all 4287 documents...

Related subjects