Results 231 to 240 of about 1,437,233 (261)
Some of the next articles are maybe not open access.
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 +3 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 +3 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
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
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
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
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 +2 more sources
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 +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 +3 more sources
Spectral graph fractional Fourier transform for directed graphs and its application
Signal Processing, 2023Bing-Zhao Li
exaly