Filters








2,398,911 Hits in 3.6 sec

Graph types

Nils Klarlund, Michael I. Schwartzbach
1993 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93  
We propose a notion of graph types, which allow common shapes, such as doubly-linked lists or threaded trees, to be expressed concisely and e ciently.  ...  We employ a second-order monadic logic to decide well-formedness of graph type speci cations. This logic can also be used for automated reasoning about pointer structures.  ...  The values of a well-formed graph type G form the set Val G of nite graphs. There is a graph for every value in the underlying data type.  ... 
doi:10.1145/158511.158628 dblp:conf/popl/KlarlundS93 fatcat:i5gkktbm5vhxlnsqqnb5uscbvm

Graph Types

Nils Klarlund, Michael I. Schwartzbach
1992 DAIMI Report Series  
We propose a notion of graph types , which allow common shapes, such as doubly-linked lists or threaded trees, to be expressed concisely and efficiently.  ...  We employ a second-order monadic logic to decide well-formedness of graph type specifications. This logic can also be used for automated reasoning about pointer structures.  ...  The values of a well-formed graph type G form the set Val G of nite graphs. There is a graph for every value in the underlying data type.  ... 
doi:10.7146/dpb.v21i421.7952 fatcat:6hvvvzajovcavkda6smapsnhny

Encapsulated Hierarchical Graphs, Graph Types, and Meta Types

Gregor Engels, Andy Schürr
1995 Electronical Notes in Theoretical Computer Science  
Furthermore, already proposed graph grammar module concepts are still too abstract to be useful in practice.  ...  Currently existing graph grammar-based speci cation languages have serious problems with supporting any kind of \speci cation-in-the-large" activities.  ...  All those graphs are typed and have to be instances of a corresponding graph type.  ... 
doi:10.1016/s1571-0661(05)80186-0 fatcat:vjbhzsqtpff63cl6ixrx7qxbca

Specifying Graph Languages with Type Graphs

Andrea Corradini, Barbara König, Dennis Nolte
2019 Journal of Logical and Algebraic Methods in Programming  
We investigate three formalisms to specify graph languages, i.e. sets of graphs, based on type graphs.  ...  First, we are interested in (pure) type graphs, where the corresponding language consists of all graphs that can be mapped homomorphically to a given type graph.  ...  Specifying graph languages using type graphs gives us the possibility to forbid certain graph structures by not including them into the type graph.  ... 
doi:10.1016/j.jlamp.2019.01.005 fatcat:atmeh7tbv5eubkofg5ezjp5j5a

Specifying Graph Languages with Type Graphs [article]

Andrea Corradini, Barbara König, Dennis Nolte
2017 arXiv   pre-print
We investigate three formalisms to specify graph languages, i.e. sets of graphs, based on type graphs.  ...  First, we are interested in (pure) type graphs, where the corresponding language consists of all graphs that can be mapped homomorphically to a given type graph.  ...  This does not seem feasible for pure type graphs or the type graph logic.  ... 
arXiv:1704.05263v2 fatcat:bxzmz4ksvbelppseb3cqc4vuti

Typed Graph Networks [article]

Marcelo O. R. Prates, Pedro H. C. Avelar, Henrique Lemos, Marco Gori, Luis Lamb
2019 arXiv   pre-print
To illustrate the generality of the original model, we present a Graph Neural Network formalisation, which partitions the vertices of a graph into a number of types.  ...  In this paper, we revisit the original Graph Neural Network model and show that it generalises many of the recent models, which in turn benefit from the insight of thinking about vertex types.  ...  Definition 1 (Typed Graph Network). A Typed Graph Network with N types is described by 1) A set of embedding sizes n 1 , n 2 . . . n N 2) A set of types T = {τ i ∈ R ni | i = 1 . . .  ... 
arXiv:1901.07984v3 fatcat:xtcepapm3rakha2r7kj5sqecvq

Fractal graph and integral graph: C-type hyper graph in graph theory

Yaozhi Jiang
2019 Applied Mathematical Sciences  
A new conception for  C type hyper graph is defined by fractal graph and integral graph in this paper.  C type hyper graph is unified the general graph and  C type hyper graph, i.e. any general graph  ...  can be seen a integral graph from a  C type hyper graph, and otherwise: any  C type hyper graph can be seen a fractal graph from a general graph.  ...  C type hyper graph.  ... 
doi:10.12988/ams.2019.812193 fatcat:xq4g4rxjebbmrchlh7mxl7glvm

Scherk-Type Capillary Graphs

Robert Huff, John McCuan
2005 Journal of Mathematical Fluid Mechanics  
This paper concerns the regularity of a capillary graph (the meniscus profile of liquid in a cylindrical tube) over a corner domain of angle α.  ...  Vol. 8 (2006) Scherk-Type Capillary Graphs 115 When 0 < γ < π/4, we have that ζ(z) = ζ(z 1 ) + (z − z 1 ) 3/2 ζ 0 (z) (23) where ζ 0 is analytic and nonvanishing at z 1 .  ...  If M is a compact, connected, smoothly immersed surface with boundary that projects simply onto the (x, y)-plane, and each point X ∈ M has an in-Vol. 8 (2006) Scherk-Type Capillary Graphs 105 trinsic  ... 
doi:10.1007/s00021-004-0140-8 fatcat:y7745dyevbd7xe6gasqawe73se

The Typed Graph Model [article]

Fritz Laux
2021 arXiv   pre-print
In this paper, we propose a schema bound Typed Graph Model with properties and labels. These enhancements improve not only data quality but also the quality of graph analysis.  ...  The model has been semantically augmented with properties and labels attached to the graph elements.  ...  Typed Graph Model Definition 2 (Typed Graph Model).  ... 
arXiv:2110.00991v1 fatcat:py7dwn56sbdvnk62lskrbjnyde

Medial symmetry type graphs [article]

Isabel Hubard, Alen Orbanić, Tomaž Pisanski, María del Río Francos
2013 arXiv   pre-print
In this paper we use symmetry type graphs to extend such study and classify all the types of 5-orbit maps, as well as all self-dual, properly and improperly, symmetry type of k-orbit maps with k≤ 7.  ...  Moreover, we determine, for small values of k, all types of k-orbits maps that are medial maps. Self-dualities constitute an important tool in this quest.  ...  A symmetry type graph is said to be self-dual if it is isomorphic to its dual type. Therefore, the symmetry type graph of a self-dual map is a self-dual symmetry type graph.  ... 
arXiv:1301.7637v1 fatcat:ao62f72byfhkxaz6cjewmdmwnq

Medial Symmetry Type Graphs

Isabel Hubard, María Del Río Francos, Alen Orbanić, Tomaž Pisanski
2013 Electronic Journal of Combinatorics  
In this paper we use symmetry type graphs to extend such study and classify all the types of $5$-orbit maps, as well as all self-dual, properly and improperly, symmetry type of $k$-orbit maps with $k\leq  ...  Moreover, we determine, for small values of $k$, all types of $k$-orbits maps that are medial maps. Self-dualities constitute an important tool in this quest.  ...  symmetry type graph T (M).  ... 
doi:10.37236/3114 fatcat:2mmnbproyffw5memmanczx7x3i

Multilevel Typed Graph Transformations [chapter]

Uwe Wolter, Fernando Macías, Adrian Rutle
2020 Lecture Notes in Computer Science  
These rules are cospans of three graphs and two inclusion graph homomorphisms where the three graphs are multilevel typed over a common typing chain.  ...  Multilevel models can be formally represented by multilevel typed graphs whose manipulation and transformation are carried out by multilevel typed graph transformation rules.  ...  Multilevel typed graphs are graphs typed over a typing chain, i.e., a sequence [G n , G n−1 , . . . , G 1 , G 0 ] of graphs where the elements in any of the graphs G i , with n ≥ i ≥ 1, are, on their part  ... 
doi:10.1007/978-3-030-51372-6_10 fatcat:uknercvojbhcbhj2nlwq5pdaze

Typing Graph-Manipulation Operations [chapter]

Jan Hidders
2002 Lecture Notes in Computer Science  
We present a graph-based data model called GDM where database instances and database schemas are described by certain types of labeled graphs called instance graphs and schema graphs.  ...  For these operations it is investigated if they can be typed such that it is guaranteed for well-typed operations that the result belongs to a certain database schema graph, and what the complexity of  ...  Typing the Reduction Typing the reduction is trivial because if a well-formed data graph belongs to a schema graph then the reduction will also belong to that schema graph.  ... 
doi:10.1007/3-540-36285-1_26 fatcat:73chxt2zcfhjrfa4urbdom7n3a

Dependently Typed Knowledge Graphs [article]

Zhangsheng Lai, Aik Beng Ng, Liang Ze Wong, Simon See, Shaowei Lin
2020 arXiv   pre-print
Using the Coq proof assistant, we demonstrate how to build and query dependently typed knowledge graphs as a proof of concept for future works in this direction.  ...  In addition to providing the basic functionalities of knowledge graphs, dependent types add expressiveness in encoding both entities and queries, explainability in answers to queries through witnesses,  ...  Dependently typed knowledge graphs A dependently typed knowledge graph (DTKG) is a knowledge graph endowed with type information.  ... 
arXiv:2003.03785v1 fatcat:q2xoxf4apbf7fgpnpqpdc3tmb4

Truncation symmetry type graphs [article]

Maria del Rio Francos
2013 arXiv   pre-print
There are operations that transform a map M (an embedding of a graph on a surface) into another map in the same surface, modifying its structure and consequently its set of flags F(M).  ...  truncated symmetry type graphs of the symmetry type graphs 3 0 , 3 2 and 3 02 , respectively.  ...  We refer to the graph T (M) as the symmetry type graph of M, and we also say that M is a k-orbit map of type T .  ... 
arXiv:1306.2540v2 fatcat:aymdew252neh3m6k6ccztuknze
« Previous Showing results 1 — 15 out of 2,398,911 results