Results 231 to 240 of about 112,189 (262)
Some of the next articles are maybe not open access.
Computer generation of vertex graphs
Information Processing Letters, 1973In connection with the problem of generating all multigraphs having a specified vertex-degree list, Lederberg1 has presented a tree-generation algorithm which, exploiting a canonical-lexical notational system, constructs the complete set of solutions in canonically increasing order, without redundancy. Brown2, et.
openaire +3 more sources
Path Length Computations on Graph Models of Computations
IEEE Transactions on Computers, 1969This paper discusses essential difficulties in calculating mean path lengths on a directed graph model of computations. This study was part of a larger study of a priori scheduling of computer programs in a parallel processing environment. Efficient approximations to mean processing time (mean path length) of programs in such an environment are given.
David F. Martin, Gerald Estrin
openaire +1 more source
Local Computations on Triangular Graphs
Fundamenta Informaticae, 2010The paper deals with the class of finite triangular graphs. It turns out that this class enjoys regular properties similar to those of trees and complete graphs. The main objective of the paper is to lift algorithms for some typical local computations, known for other classes of graphs, to the class of triangular graphs.
openaire +2 more sources
Graph rewriting as a computational model
1991Graph Rewriting can be viewed as a rather general framework which encompasses a variety of ‘New generation’ computational models, ranging from functional languages through logic languages of the commited choice variety to actor (object) languages.
D. L. McBurney, M. Ronan Sleep
openaire +2 more sources
1986
The last subject that I want to cover briefly is of more technical nature. For more information the reader is refered to the literature quoted in this section.
openaire +1 more source
The last subject that I want to cover briefly is of more technical nature. For more information the reader is refered to the literature quoted in this section.
openaire +1 more source
Traffic Incident Detection Based on Dynamic Graph Embedding in Vehicular Edge Computing
Applied Sciences (Switzerland), 2021Tri-Hai Nguyen, Jason J Jung
exaly
Graph-Reinforcement-Learning-Based Task Offloading for Multiaccess Edge Computing
IEEE Internet of Things Journal, 2023Chen Yu, Yijun Mo
exaly
Exploring big graph computing — An empirical study from architectural perspective
Journal of Parallel and Distributed Computing, 2017Lifeng Nai, Yinglong Xia
exaly
Graph partitioning models for parallel computing
Parallel Computing, 2000Tamara G. Kolda, Bruce Alan Hendrickson
exaly