Bibliografías temáticas / Multigraphed

Índice

  1. Artículos de revistas
  2. Tesis
  3. Libros
  4. Capítulos de libros
  5. Actas de conferencias
  6. Informes

Literatura académica sobre el tema "Multigraphed"

Autor: Grafiati
Publicado: 27 de julio de 2024
Última modificación: 31 de julio de 2025

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Multigraphed".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Artículos de revistas sobre el tema "Multigraphed"

1

Ashrafi, Ali Reza, Alain Bretto, and Alain Faisant. "Linear Representation of Graphs: Applications to Molecular Graphs." Match - Communications in Mathematical and in Computer Chemistry 90, no. 1 (2023): 5–18. http://dx.doi.org/10.46793/match.90-1.005a.

Texto completo
Resumen
In this article we build a linear representation starting from a multigraph; this allows us to give an algebraic view of the multigraph we are studying. We show that two isomorphic multigraphs give equivalent representations; conversely two equivalent representations give isomorphic multigraphs. For the clarity of the article we give at the beginning, classical results on representations, nevertheless these are specific to our graph representation.
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Grzelec, Igor, and Mariusz Wo�niak. "Local irregularity conjecture for 2-multigraphs versus cacti." Opuscula Mathematica 44, no. 1 (2024): 49–65. http://dx.doi.org/10.7494/opmath.2024.44.1.49.

Texto completo
Resumen
A multigraph is locally irregular if the degrees of the end-vertices of every multiedge are distinct. The locally irregular coloring is an edge coloring of a multigraph \(G\) such that every color induces a locally irregular submultigraph of \(G\). A locally irregular colorable multigraph \(G\) is any multigraph which admits a locally irregular coloring. We denote by \(\textrm{lir}(G)\) the locally irregular chromatic index of a multigraph \(G\), which is the smallest number of colors required in the locally irregular coloring of the locally irregular colorable multigraph \(G\). In case of gra
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Chetwynd, A. G., and A. J. W. Hilton. "Star multigraphs with three vertices of maximum degree." Mathematical Proceedings of the Cambridge Philosophical Society 100, no. 2 (1986): 303–17. http://dx.doi.org/10.1017/s030500410006610x.

Texto completo
Resumen
The graphs we consider here are either simple graphs, that is they have no loops or multiple edges, or are multigraphs, that is they may have more than one edge joining a pair of vertices, but again have no loops. In particular we shall consider a special kind of multigraph, called a star-multigraph: this is a multigraph which contains a vertex v*, called the star-centre, which is incident with each non-simple edge. An edge-colouring of a multigraph G is a map ø: E(G)→, where is a set of colours and E(G) is the set of edges of G, such that no two edges receiving the same colour have a vertex i
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Janson, Svante. "The probability that a random multigraph is simple. II." Journal of Applied Probability 51, A (2014): 123–37. http://dx.doi.org/10.1239/jap/1417528471.

Texto completo
Resumen
Consider a random multigraph G* with given vertex degrees d1,…, dn, constructed by the configuration model. We give a new proof of the fact that, asymptotically for a sequence of such multigraphs with the number of edges the probability that the multigraph is simple stays away from 0 if and only if The new proof uses the method of moments, which makes it possible to use it in some applications concerning convergence in distribution. Corresponding results for bipartite graphs are included.
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

JANSON, SVANTE. "The Probability That a Random Multigraph is Simple." Combinatorics, Probability and Computing 18, no. 1-2 (2009): 205–25. http://dx.doi.org/10.1017/s0963548308009644.

Texto completo
Resumen
Consider a random multigraph G* with given vertex degrees d1,. . .,dn, constructed by the configuration model. We show that, asymptotically for a sequence of such multigraphs with the number of edges $\tfrac12\sumd\to\infty$, the probability that the multigraph is simple stays away from 0 if and only if $\sumdd=O\bigpar{\sumd}$. This was previously known only under extra assumptions on the maximum degree maxidi. We also give an asymptotic formula for this probability, extending previous results by several authors.
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Janson, Svante. "The probability that a random multigraph is simple. II." Journal of Applied Probability 51, A (2014): 123–37. http://dx.doi.org/10.1017/s0021900200021239.

Texto completo
Resumen
Consider a random multigraph G * with given vertex degrees d 1,…, d n , constructed by the configuration model. We give a new proof of the fact that, asymptotically for a sequence of such multigraphs with the number of edges the probability that the multigraph is simple stays away from 0 if and only if The new proof uses the method of moments, which makes it possible to use it in some applications concerning convergence in distribution. Corresponding results for bipartite graphs are included.
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

DELCROIX, STEFAAN, and MICHAEL J. FISHER. "THE HAUSDORFF DIMENSION OF A GRAPH-DIRECTED SET WHOSE UNDERLYING MULTIGRAPH IS A CARTESIAN PRODUCT OR A TENSOR PRODUCT OF MULTIGRAPHS." Fractals 20, no. 03n04 (2012): 217–25. http://dx.doi.org/10.1142/s0218348x12500193.

Texto completo
Resumen
In this paper, we compute the Hausdorff dimension of a graph-directed set when the underlying multigraph is a Cartesian product or a tensor product of several multigraphs. We give explicit formulas in terms of the eigenvalues of the graph and the similarity ratios used with each graph.
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Bertacchi, Daniela, and Fabio Zucca. "Critical Behaviors and Critical Values of Branching Random Walks on Multigraphs." Journal of Applied Probability 45, no. 2 (2008): 481–97. http://dx.doi.org/10.1239/jap/1214950362.

Texto completo
Resumen
We consider weak and strong survival for branching random walks on multigraphs with bounded degree. We prove that, at the strong critical value, the process dies out locally almost surely. We relate the weak critical value to a geometric parameter of the multigraph. For a large class of multigraphs (which enlarges the class of quasi-transitive or regular graphs), we prove that, at the weak critical value, the process dies out globally almost surely. Moreover, for the same class, we prove that the existence of a pure weak phase is equivalent to nonamenability. The results are extended to branch
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Bertacchi, Daniela, and Fabio Zucca. "Critical Behaviors and Critical Values of Branching Random Walks on Multigraphs." Journal of Applied Probability 45, no. 02 (2008): 481–97. http://dx.doi.org/10.1017/s002190020000437x.

Texto completo
Resumen
We consider weak and strong survival for branching random walks on multigraphs with bounded degree. We prove that, at the strong critical value, the process dies out locally almost surely. We relate the weak critical value to a geometric parameter of the multigraph. For a large class of multigraphs (which enlarges the class of quasi-transitive or regular graphs), we prove that, at the weak critical value, the process dies out globally almost surely. Moreover, for the same class, we prove that the existence of a pure weak phase is equivalent to nonamenability. The results are extended to branch
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Azizov, Asadulla, Elnara Ametova, Qurbonali Nuriddinov, and Saidazim Ubaydullayev. "The operation model of the point setting relay for a microelectronic device." E3S Web of Conferences 515 (2024): 04001. http://dx.doi.org/10.1051/e3sconf/202451504001.

Texto completo
Resumen
The application of electromagnetic relays in train control systems in rail transport is a challenging task. The solution of this innovative problem is based on the use of microelectronic, contactless elements, graph theory, process modeling, and the use of microprocessors. A Petri net multigraph has been developed and investigated for various operating modes of route cutting relays. Multigraphs, the functional diagram, and the algorithm of operation of the microelectronic relay block are given.
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Tesis sobre el tema "Multigraphed"

1

Ben, Ticha Hamza. "Vehicle Routing Problems with road-network information." Thesis, Université Clermont Auvergne‎ (2017-2020), 2017. http://www.theses.fr/2017CLFAC071/document.

Texto completo
Resumen
Les problèmes de tournées de véhicules (VRPs) ont fait l’objet de plusieurs travaux de recherche depuis maintenant plus de 50 ans. La plupart des approches trouvées dans la littérature s’appuient sur un graphe complet ou un nœud est introduit pour tout point d’intérêt du réseau routier (typiquement les clients et le dépôt). Cette modélisation est, implicitement, basée sur l’hypothèse que le meilleur chemin entre toute paire de points du réseau routier est bien défini. Cependant, cette hypothèse n’est pas toujours valide dans de nombreuses situations. Souvent, plus d’informations sont nécessair
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Ingalalli, Vijay. "Querying and Mining Multigraphs." Thesis, Montpellier, 2017. http://www.theses.fr/2017MONTS080/document.

Texto completo
Resumen
Avec des volumes de données et d’informations de plus en plus importants, des données de plus en plus complexes et fortement inter-reliées, l’extraction de connaissances reste un véritable défi. Les graphes offrent actuellement un support de représentation efficace pour représenter ces données. Parmi les approches existantes, les multi-graphes ont montré que leur pouvoir d’expression était particulièrement adapté pour manipuler des données complexes possédant de nombreux types de relations entre elles. Cette thèse aborde deux aspects principaux liés aux multigraphes : la recherche de sous grap
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Grünewald, Stefan. "Chromatic index critical graphs and multigraphs." [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=961050462.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

McClain, Christopher. "Edge colorings of graphs and multigraphs." Columbus, Ohio : Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1211904033.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Ishii, Toshimasa. "Studies on Multigraph Connectivity Augmentation Problems." 京都大学 (Kyoto University), 2000. http://hdl.handle.net/2433/180897.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Shafie, Termeh. "Random Multigraphs : Complexity Measures, Probability Models and Statistical Inference." Doctoral thesis, Stockholms universitet, Statistiska institutionen, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-82697.

Texto completo
Resumen
This thesis is concerned with multigraphs and their complexity which is defined and quantified by the distribution of edge multiplicities. Two random multigraph models are considered.  The first model is random stub matching (RSM) where the edges are formed by randomly coupling pairs of stubs according to a fixed stub multiplicity sequence. The second model is obtained by independent edge assignments (IEA) according to a common probability distribution over the edge sites. Two different methods for obtaining an approximate IEA model from an RSM model are also presented. In Paper I, multigraphs
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Vaikkathe, Ananthakrishnan. "Optimization of Synchromodal Container Transportation." Electronic Thesis or Diss., Normandie, 2024. http://www.theses.fr/2024NORMLH40.

Texto completo
Resumen
Cette thèse explore la mise en œuvre de la synchromodalité dans le transport de conteneurs en arrière-pays. La synchromodalité, une forme avancée de transport multimodal, offre une flexibilité et une résilience accrues pour le transport de fret conteneurisé. Bien que le transport routier ait traditionnellement dominé ce secteur, la synchromodalité vise à promouvoir un transfert modal stratégique vers des modes de transport plus durables, tels que le rail et les voies navigables intérieures. Le principal défi opérationnel réside dans la détermination de l’itinéraire optimal pour le transport de
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Rahme, Youssef. "Stochastic matching model on the general graphical structures." Thesis, Compiègne, 2021. http://www.theses.fr/2021COMP2604.

Texto completo
Resumen
Motivé par des applications à large éventail des systèmes d’assemblage à la commande et des systèmes de l’économie collaborative, nous introduisons un modèle d’appariement aléatoire sur les hypergraphes et sur les multigraphes, étendant le modèle par Mairesse et Moyal 2016. Dans cette thèse, le modèle d’appariement aléatoire sur les structures graphiques générales est défini comme suit : étant donné une structure graphique générale de compatibilité S = (V; S) qui est constituée d’un ensemble de nœuds noté par V qui représentent les classes d’éléments et par un ensemble d’arêtes noté par S qui
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Jamali, Pierre. "Application of the multigraph software architecture to intelligent patient monitoring." Thesis, City University London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.307866.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Borozan, Valentin. "Proper and weak-proper trees in edges-colored graphs and multigraphs." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00738959.

Texto completo
Resumen
Dans la présente thèse nous étudions l'extraction d'arbres dans des graphes arêtes-coloriés.Nous nous concentrons sur la recherche d'arbres couvrants proprement arête-coloriés et faiblement arête-coloriés, notée PST et WST. Nous montrons que les versions d'optimisation de ces problèmes sont NP-Complete dans le cas général des graphes arêtes-coloriés, et nous proposons des algorithmes pour trouver ces arbres dans le cas des graphes arêtes-coloriés sans cycles proprement arêtes-coloriés.Nous donnons également quelques limites de nonapproximabilité. Nous proposons des conditions suffisantes pour
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Libros sobre el tema "Multigraphed"

1

Keedwell, James Owen. Homotopy invariants of randomly evolving multigraphs. University of Manchester, 1995.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Materials, Information Technology Educational. A self-instructional guide to Multigraph. ITEM, 1988.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Khamis, Harry. The Association Graph and the Multigraph for Loglinear Models. SAGE Publications, Inc., 2011. http://dx.doi.org/10.4135/9781452226521.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Metcalfe, A., Inmaculada Pérez Martín, and Giuseppe Mandalà. Multilingual and multigraphic documents and manuscripts of East and West. Gorgias Press, 2015.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Mandalà, Giuseppe, and Inmaculada Pérez Martín, eds. Multilingual and Multigraphic Documents and Manuscripts of East and West. Gorgias Press, 2018. http://dx.doi.org/10.31826/9781463240004.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Godehardt, Erhard. Graphs as structural models: The application of graphs and multigraphs in cluster analysis. Friedr. Vieweg, 1988.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Quinney, Douglas, Howard A. Anton, and Intellipro. Multigraph. John Wiley & Sons Inc, 1996.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Quinney, Douglas, Intellipro, and Saturnino L. Salas. Multigraph. John Wiley & Sons Inc, 1996.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Khamis, Harry J. Association Graph and the Multigraph for Loglinear Models. SAGE Publications, Incorporated, 2012.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

The association graph and the multigraph for loglinear models. SAGE, 2011.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Capítulos de libros sobre el tema "Multigraphed"

1

Schwartz, Richard. "Multigraph PETs." In Mathematical Surveys and Monographs. American Mathematical Society, 2014. http://dx.doi.org/10.1090/surv/197/03.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Meissner, Leah H., and John T. Saccoman. "Strongly Regular Multigraphs." In Springer Proceedings in Mathematics & Statistics. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-62166-6_15.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Peccati, Giovanni, and Murad S. Taqqu. "Diagrams and multigraphs." In Wiener Chaos: Moments, Cumulants and Diagrams. Springer Milan, 2011. http://dx.doi.org/10.1007/978-88-470-1679-8_4.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Ibrahim, Mohamed, Shagufta Henna, and Gary Cullen. "Multi-Graph Convolutional Neural Network for Breast Cancer Multi-task Classification." In Communications in Computer and Information Science. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-26438-2_4.

Texto completo
Resumen
AbstractMammography is a popular diagnostic imaging procedure for detecting breast cancer at an early stage. Various deep-learning approaches to breast cancer detection incur high costs and are erroneous. Therefore, they are not reliable to be used by medical practitioners. Specifically, these approaches do not exploit complex texture patterns and interactions. These approaches warrant the need for labelled data to enable learning, limiting the scalability of these methods with insufficient labelled datasets. Further, these models lack generalisation capability to new-synthesised patterns/text
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Wallis, W. D. "One-Factorizations of Multigraphs." In One-Factorizations. Springer US, 1997. http://dx.doi.org/10.1007/978-1-4757-2564-3_17.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

de Fraysseix, Hubert, and Patrice Ossona de Mendez. "Regular Embeddings of Multigraphs." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/3-540-33700-8_26.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Montanari, Angela, and Gabriele Soffritti. "Analysing Dissimilarities through Multigraphs." In Studies in Classification, Data Analysis, and Knowledge Organization. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-60126-2_19.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Schneidhofer, Bernhard, and Stephen Wolthusen. "Multigraph Critical Infrastructure Model." In Critical Infrastructure Protection X. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-48737-3_9.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Korczyński, Waldemar, José de Jesús Cruz Guzmán, and Zbigniew Oziewicz. "Multilevel System as Multigraph." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44862-4_90.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Barlet, Daniel, and Jón Magnússon. "Multigraphs and Reduced Complex Spaces." In Grundlehren der mathematischen Wissenschaften. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-31163-6_2.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.

Actas de conferencias sobre el tema "Multigraphed"

1

Tassew, Bethlehem, Muhammad Adeel Ijaz, Geng Chen, and Islem Rekik. "Scalable and Efficient Multigraph Integration with Sparse-Clustered Deep Graph Normalization." In 2024 IEEE International Conference on Bioinformatics and Biomedicine (BIBM). IEEE, 2024. https://doi.org/10.1109/bibm62325.2024.10822066.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Shi, Guangyao, Feng Chen, and Wenhao Xiang. "Tensor-based multigraph structure preserving embedding for dimensionality reduction of hyperspectral images." In Third International Conference on Geographic Information and Remote Sensing Technology (GIRST 2024), edited by Francesco Benedetto, Fabio Tosti, and Roman Alvarez. SPIE, 2025. https://doi.org/10.1117/12.3059837.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Li, Yihan, and Jinwei Wang. "Recognition of implicit discourse relations in paragraphing based on multigraph convolutional networks." In 4th International Conference on Electronic Information Engineering and Data Processing (EIEDP 2025), edited by Azlan Bin Mohd Zain and Lei Chen. SPIE, 2025. https://doi.org/10.1117/12.3067106.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Rooj, Suparna, Patitapaban Palo, Rahul Mahadik, Aurobinda Routray, and Manas K. Mandal. "Improving Thermal Facial Emotion Recognition in Subject-Independent Scenarios Through Multigraph Convolutional Networks." In 2024 32nd European Signal Processing Conference (EUSIPCO). IEEE, 2024. http://dx.doi.org/10.23919/eusipco63174.2024.10715389.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Liu, Songwei, Lilla Beke, and Jun Chen. "Heuristic Initialisation based on Graph Structures for Shortest Path Search on Multi-objective Multigraphs." In 2025 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2025. https://doi.org/10.1109/cec65147.2025.11042998.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Ben-Nun, Tal, Johannes de Fine Licht, Alexandros N. Ziogas, Timo Schneider, and Torsten Hoefler. "Stateful dataflow multigraphs." In SC '19: The International Conference for High Performance Computing, Networking, Storage, and Analysis. ACM, 2019. http://dx.doi.org/10.1145/3295500.3356173.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Du, Juan. "T-Colorings of Multigraphs." In Its Applications and Embedded Sys (CDEE). IEEE, 2010. http://dx.doi.org/10.1109/cdee.2010.78.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Wu, Danyang, Xinjie Shen, Jitao Lu, Jin Xu, and Feiping Nie. "Simple Multigraph Convolution Networks." In WWW '24: The ACM Web Conference 2024. ACM, 2024. http://dx.doi.org/10.1145/3589335.3651560.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Boonma, Pruet, and Juggapong Natwichai. "Reliable Cluster on Uncertain Multigraph." In 2015 18th International Conference on Network-Based Information Systems (NBiS). IEEE, 2015. http://dx.doi.org/10.1109/nbis.2015.73.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Lakhotia, Arun. "Constructing call multigraphs using dependence graphs." In the 20th ACM SIGPLAN-SIGACT symposium. ACM Press, 1993. http://dx.doi.org/10.1145/158511.158647.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.

Informes sobre el tema "Multigraphed"

1

Green, Alastair, Paolo Guagliardo, and Leonid Libkin. Property graphs and paths in GQL: Mathematical definitions. Linked Data Benchmark Council, 2021. http://dx.doi.org/10.54285/ldbc.tzjp7279.

Texto completo
Resumen
This paper provides precise mathematical definitions of a property graph as specified in the proposed GQL international standard, which is an attributed mixed multigraph with loops. It further defines a partially-oriented walk in such a property graph, which is called a path in GQL, as well as restricted classes of such walks (trails, simple/acyclic paths).
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Sztipanovits, Janos, Ben Abbott, and Hubertus Franke. MULTIGRAPH: An Architecture for Model-Based Programming. Model-Based Program Synthesis for Parallel Computing. PREMOS: Programming Environment for Model-Based Program Synthesis. Version 01.00.00,. Defense Technical Information Center, 1994. http://dx.doi.org/10.21236/ada276949.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
También puede estar interesado en las bibliografías ampliadas sobre el tema "Multigraphed" para tipos de fuentes particulares:
Artículos de revistas Tesis Libros
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!

Pasar a la bibliografía