abstract. suppose g is an nvertex and medge simple graph with edge set e(g). an integervalued function f: e(g) → z is called a flow. tutte was introduced the flow polynomial f(g, λ) as a polynomial in an indeterminate λ with integer coefficients by f(g,λ) in this paper the flow polynomial of some dendrimers are computed.

The ordering of operations in a data flow program is not specified by the programmer, but is implied by the data dependencies. This advantage can be exploited further on multiprocessor architectures by grouping the nodes in the corresponding data flow graph and allocating these groups efficiently to processors. This paper presents and compares some of the numerous heuristic approaches that were...

Many scientific and engineering processes produce spatially unstructured data. However, most data-driven models require a feature matrix that enforces both set number order of features for each sample. They thus cannot be easily constructed an dataset. Therefore, graph based model to perform inference on fields defined mesh, using Graph Convolutional Neural Network (GCNN) is presented. The abil...

Data flow graph is a useful computational model to describe the functionality of a digital system. To execute a data flow graph on a target system, it should be synthesized to the code to be compiled on the target system. Current research activities on software synthesis are mainly focused on Synchronous Data Flow (SDF) graph, which can not represent the control structure of the application. On...

The paper presents a data flow graph exchange standard, agreed upon and used by the partners in the ESPRIT research project ASCIS. These data flow graphs are generated from known user interface languages such as Silage, VHDL, and C, and are used to drive architectural synthesis packages and formal verification. The graph semantics are defined to offer a unique degree of freedom for time and are...

Abstract Runtime systems can significantly reduce the cognitive complexity of scientific applications, narrowing gap between engineering and domain science in HPC. One most important angles this is automating data migration a cluster. Traditional approaches require application developer to model communication explicitly, for example through MPI primitives. Celerity, runtime system accelerator c...

Data flow graph is a useful computational model to describe the functionality of a digital system. To execute a data flow graph on a target system, it should be synthesized to the code to be compiled on the target system. Current research activities on software synthesis are mainly focused on Synchronous Data Flow (SDF) graph, a special case of data flow graph [Lee87a]. Even though the static p...