Results 251 to 260 of about 608,783 (278)
Some of the next articles are maybe not open access.
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
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
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
Topology aggregation for directed graph
Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166), 2001This paper addresses the problem of aggregating the topology of a sub-network in a compact way with minimum distortion. The problem arises from networks that have a hierarchical structure, where each sub-network must advertise the cost of routing between each pair of its border nodes.
Baruch Awerbuch, Yuval Shavitt
openaire +1 more source
2018
This edited volume offers a detailed account on the theory of directed graphs from the perspective of important classes of digraphs, with each chapter written by experts on the topic.Outlining fundamental discoveries and new results obtained over recent years, this book provides a comprehensive overview of the latest research in the field.
openaire +2 more sources
This edited volume offers a detailed account on the theory of directed graphs from the perspective of important classes of digraphs, with each chapter written by experts on the topic.Outlining fundamental discoveries and new results obtained over recent years, this book provides a comprehensive overview of the latest research in the field.
openaire +2 more sources
Disjoint directed quadrilaterals in a directed graph
Journal of Graph Theory, 2005AbstractLet D be a directed graph of order 4k, where k is a positive integer. Suppose that the minimum degree of D is at least 6k − 2. We show that D contains k disjoint directed quadrilaterals with only one exception. © 2005 Wiley Periodicals, Inc.
Danhong Zhang, Hong Wang 0005
openaire +1 more source
Disjoint directed cycles in directed graphs
Discrete Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Localization and Universality of Eigenvectors in Directed Random Graphs
Physical Review Letters, 2021Fernando Metz, Izaak Neri
exaly