Results 241 to 250 of about 839,618 (278)
Some of the next articles are maybe not open access.
Software: Practice and Experience, 1987
AbstractA general‐purpose browser for directed graphs is described. The browser provides operations to examine and edit graphs and to generate a layout for a graph automatically that minimizes edge crossings. Two layout algorithms were implemented. A hierarchical graph layout algorithm was found to be best for directed graphs.
Lawrence A. Rowe +5 more
openaire +1 more source
AbstractA general‐purpose browser for directed graphs is described. The browser provides operations to examine and edit graphs and to generate a layout for a graph automatically that minimizes edge crossings. Two layout algorithms were implemented. A hierarchical graph layout algorithm was found to be best for directed graphs.
Lawrence A. Rowe +5 more
openaire +1 more source
Networks, 2008
AbstractThe concept of persistent directed graphs was introduced by Hendrickx et al. to help analyze the stability of autonomous agent systems. They provided a combinatorial characterization for persistence but the complexity of testing persistence remained open.
Jørgen Bang-Jensen, Tibor Jordán
openaire +1 more source
AbstractThe concept of persistent directed graphs was introduced by Hendrickx et al. to help analyze the stability of autonomous agent systems. They provided a combinatorial characterization for persistence but the complexity of testing persistence remained open.
Jørgen Bang-Jensen, Tibor Jordán
openaire +1 more source
Journal of Graph Theory, 2009
AbstractAn antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, …, m} such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it admits an antimagic labeling.
Dan Hefetz +2 more
openaire +2 more sources
AbstractAn antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, …, m} such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it admits an antimagic labeling.
Dan Hefetz +2 more
openaire +2 more sources
Directed Graphs and Substitutions
Theory of Computing Systems, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Holton, C., Zamboni, L. Q.
openaire +2 more sources
SIAM Journal on Algebraic Discrete Methods, 1985
This very interesting paper introduces the concept of graceful directed graphs as follows. A digraph D with e arcs is numbered by assigning a distinct integer value h(v) from \(\{\) 0,1,...,e\(\}\) to each node v. Each arc (u,v) receives a value \(h(u,v)=h(v)-h(u)\) (mod e\(+1)\).
Bloom, G. S., Hsu, D. F.
openaire +1 more source
This very interesting paper introduces the concept of graceful directed graphs as follows. A digraph D with e arcs is numbered by assigning a distinct integer value h(v) from \(\{\) 0,1,...,e\(\}\) to each node v. Each arc (u,v) receives a value \(h(u,v)=h(v)-h(u)\) (mod e\(+1)\).
Bloom, G. S., Hsu, D. F.
openaire +1 more source
Decomposition of Directed Graphs
SIAM Journal on Algebraic Discrete Methods, 1982A composition for directed graphs which generalizes the substitution (or X-join) composition of graphs and digraphs, as well as the graph version of set-family composition, is described. It is proved that a general decomposition theory can be applied to the resulting digraph decomposition.
openaire +1 more source
Information Processing Letters, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alan J. Hoffman +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alan J. Hoffman +2 more
openaire +1 more source
IEEE Transactions on Software Engineering, 1988
A non-two-phase database concurrency control technique is introduced. The technique is deadlock-free, places no restrictions on the structure of the data, never requires data to be reread, never forces a transaction to be rolled back in order to achieve serializability, applies a type of lock conversion, and allows items to be released to subsequent ...
openaire +1 more source
A non-two-phase database concurrency control technique is introduced. The technique is deadlock-free, places no restrictions on the structure of the data, never requires data to be reread, never forces a transaction to be rolled back in order to achieve serializability, applies a type of lock conversion, and allows items to be released to subsequent ...
openaire +1 more source
On the Group of a Directed Graph
Canadian Journal of Mathematics, 1966In 1938, Frucht (2) proved that for any given finite group G there exists a finite symmetric graph X such that G(X) is abstractly isomorphic to G. Since G(X) is a permutation group, it is natural to ask the following related question : If P is a given finite permutation group, does there exist a symmetric (and more generally a directed) graph X such ...
openaire +1 more source
2011
We address how the structure of a social communication system affects language coordination. The naming game is an abstraction of lexical acquisition dynamics, in which N agents try to find an agreement on the names to give to objects. Most results on naming games are specific to certain communication network topologies.
Giorgio Gosti, William H. Batchelder
openaire +1 more source
We address how the structure of a social communication system affects language coordination. The naming game is an abstraction of lexical acquisition dynamics, in which N agents try to find an agreement on the names to give to objects. Most results on naming games are specific to certain communication network topologies.
Giorgio Gosti, William H. Batchelder
openaire +1 more source