Log in

Relevant bibliographies by topics / Graph relabeling

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'Graph relabeling'

Author: Grafiati

Published: 4 June 2021

Last updated: 17 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graph relabeling.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Graph relabeling"

1

Litovsky, I., Y. M�tivier, and E. Sopena. "Different local controls for graph relabeling systems." Mathematical Systems Theory 28, no. 1 (1995): 41–65. http://dx.doi.org/10.1007/bf01294595.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Engelfriet, Joost, George Leih, and Emo Welzl. "Boundary graph grammars with dynamic edge relabeling." Journal of Computer and System Sciences 40, no. 3 (1990): 307–45. http://dx.doi.org/10.1016/0022-0000(90)90002-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kim, Changwook, and Mahiro Ando. "Node replacement graph grammars with dynamic node relabeling." Theoretical Computer Science 583 (June 2015): 40–50. http://dx.doi.org/10.1016/j.tcs.2015.03.040.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kantabutra, Sanpawat. "Fast Sequential and Parallel Vertex Relabelings of Km,m." International Journal of Foundations of Computer Science 26, no. 01 (2015): 33–50. http://dx.doi.org/10.1142/s0129054115500021.

Full text

Abstract:

Given an undirected, connected, simple graph G = (V,E), two vertex labelings LV and L'V of the vertices of G, and a label flip operation that interchanges a pair of labels on adjacent vertices, the Vertex Relabeling Problem is to transform G from LV into L'V using the flip operation. Agnarsson et al. showed solving the Vertex Relabeling Problem on arbitrary graphs can be done in θ(n2), where n is the number of vertices in G. In this article we study the Vertex Relabeling Problem on graphs Km,m and introduce the concept of parity and precise labelings. We show that, when we consider the parity

APA, Harvard, Vancouver, ISO, and other styles

5

Sopena, Eric. "EXPANDING GRAPH RELABELING SYSTEMS HAVE THE POWER OF RECURSIVE ENUMERABILITY." Fundamenta Informaticae 27, no. 1 (1996): 1–25. http://dx.doi.org/10.3233/fi-1996-27101.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ding, Huafeng, and Zhen Huang. "The Establishment of the Canonical Perimeter Topological Graph of Kinematic Chains and Isomorphism Identification." Journal of Mechanical Design 129, no. 9 (2006): 915–23. http://dx.doi.org/10.1115/1.2748451.

Full text

Abstract:

Some new concepts, such as the perimeter loop, the maximum perimeter degree-sequence, and the perimeter topological graph, are first presented in this paper, and the method for obtaining the perimeter loop is also involved. Then, based on the perimeter topological graph and some rules for relabeling its vertices canonically, a one-to-one descriptive method, the canonical adjacency matrix set of kinematic chains, is proposed. Another very important characteristic of the descriptive method is that in the canonical adjacency matrix set the element number is reduced dramatically, usually to only o

APA, Harvard, Vancouver, ISO, and other styles

7

Kamakshi, S., and Sairam Natarajan. "Distributed Algorithm for Constructing Efficient Tree Topology for Message Dissemination in Vehicular Networks." International Journal of Vehicular Technology 2014 (February 20, 2014): 1–9. http://dx.doi.org/10.1155/2014/903895.

Full text

Abstract:

Vehicular ad hoc network is an ad hoc network constituted among moving vehicles that have wireless dedicated short range communication (DSRC) devices in order to provide ubiquitous connectivity even if the road-side infrastructure is unavailable. Message dissemination in vehicular ad hoc networks is necessary for exchanging information about prevailing traffic information, so that the vehicles can take alternate routes to avoid traffic jam. A major challenge in broadcast protocols is that they result in flooding of messages that reduce the speed of dissemination due to collision. Dissemination

APA, Harvard, Vancouver, ISO, and other styles

8

Leng, Qingming, Haiou Yang, and Junjun Jiang. "Label Noise Cleansing with Sparse Graph for Hyperspectral Image Classification." Remote Sensing 11, no. 9 (2019): 1116. http://dx.doi.org/10.3390/rs11091116.

Full text

Abstract:

In a real hyperspectral image classification task, label noise inevitably exists in training samples. To deal with label noise, current methods assume that noise obeys the Gaussian distribution, which is not the real case in practice, because in most cases, we are more likely to misclassify training samples at the boundaries between different classes. In this paper, we propose a spectral–spatial sparse graph-based adaptive label propagation (SALP) algorithm to address a more practical case, where the label information is contaminated by random noise and boundary noise. Specifically, the SALP m

APA, Harvard, Vancouver, ISO, and other styles

9

Bauderon, M., Y. Métivier, M. Mosbah, and A. Sellami. "Graph Relabelling Systems." Electronic Notes in Theoretical Computer Science 51 (May 2002): 93–107. http://dx.doi.org/10.1016/s1571-0661(04)80194-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Derbel, Bilel, and Mohamed Mosbah. "Distributed Graph Traversals by Relabelling Systems with Applications." Electronic Notes in Theoretical Computer Science 154, no. 2 (2006): 79–94. http://dx.doi.org/10.1016/j.entcs.2005.03.034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Graph relabeling"

1

Hamon, Ronan. "Analyse de réseaux temporels par des méthodes de traitement du signal : application au système de vélos en libre-service à Lyon." Thesis, Lyon, École normale supérieure, 2015. http://www.theses.fr/2015ENSL1017/document.

Full text

Abstract:

Les systèmes de vélos en libre-service sont devenus des éléments indispensables dans les offres de transport urbain des grandes villes mondiales. À partir des données que ces systèmes génèrent, il est possible d'avoir une caractérisation fine de l'utilisation du vélo en milieu urbain, tant sur des problématiques traitant du domaine des transports que des aspects socio-économiques. Comme pour de nombreux domaines profitant de la récente abondance en données permises par les technologies actuelles de communication et de stockage de l'information, les enjeux actuels résident dans le développement

APA, Harvard, Vancouver, ISO, and other styles

2

Laplace, Rémi. "Applications et services DTN pour flotte collaborative de drones." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2012. http://tel.archives-ouvertes.fr/tel-00795890.

Full text

Abstract:

Les travaux présentés dans cette thèse effectuée au LaBRI portent sur la mise en place d'une flotte de drones et le portage sur celle-ci d'applications collaboratives distribuées utilisant des communications asynchrones non sûres. Ces applications sont formalisées grâce au modèle de réétiquetage de graphes Asynchronous Dynamicity Aware Graph Relabeling System (ADAGRS) que nous proposons. Au delà des contributions théoriques, ces travaux ont débouché sur la mise en place du démonstrateur CARUS dans lequel cinq drones se partagent la surveillance d'une grille de 15 points d'incidents potentiels

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Graph relabeling"

1

Overbeek, Roy, Jörg Endrullis, and Aloïs Rosset. "Graph Rewriting and Relabeling with PBPO$$^{+}$$." In Graph Transformation. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-78946-6_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Habel, Annegret, and Detlef Plump. "Relabelling in Graph Transformation." In Graph Transformation. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45832-8_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Casteigts, Arnaud, and Serge Chaumette. "Dynamicity Aware Graph Relabeling Systems and the Constraint Based Synchronization: A Unifying Approach to Deal with Dynamic Networks." In Wireless Algorithms, Systems, and Applications. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11814856_64.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Godard, Emmanuel, Yves Métivier, Mohamed Mosbah, and Afif Sellami. "Termination Detection of Distributed Algorithms by Graph Relabelling Systems." In Graph Transformation. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45832-8_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bottreau, Anne, and Yves Métivier. "Minor searching, normal forms of graph relabelling: Two applications based on enumerations by graph relabelling." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0053545.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Litovsky, Igor, and Yves Métivier. "Computing with graph relabelling systems with priorities." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/bfb0017412.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

LITOVSKY, IGOR, YVES MÉTIVIER, and ÉRIC SOPENA. "GRAPH RELABELLING SYSTEMS AND DISTRIBUTED ALGORITHMS." In Handbook of Graph Grammars and Computing by Graph Transformation. WORLD SCIENTIFIC, 1999. http://dx.doi.org/10.1142/9789812814951_0001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graph relabeling"

1

Techaploog, Wiriya, and Sanpawat Kantabutra. "Graph Relabeling with Privileged Edge Labels." In 2009 6th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON). IEEE, 2009. http://dx.doi.org/10.1109/ecticon.2009.5137139.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Agnarsson, Geir, Raymond Greenlaw, and Sanpawat Kantabutra. "The graph relabeling problem and its variants." In 2008 5th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON). IEEE, 2008. http://dx.doi.org/10.1109/ecticon.2008.4600370.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Esfahani, Mohsen Koohi, Peter Kilpatrick, and Hans Vandierendonck. "How Do Graph Relabeling Algorithms Improve Memory Locality?" In 2021 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS). IEEE, 2021. http://dx.doi.org/10.1109/ispass51385.2021.00023.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Takami, Sousuke, and Akihiro Inokuchi. "Accurate and Fast Computation of Approximate Graph Edit Distance based on Graph Relabeling." In 7th International Conference on Pattern Recognition Applications and Methods. SCITEPRESS - Science and Technology Publications, 2018. http://dx.doi.org/10.5220/0006540000170026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Lee, O.-Joun, and Jason J. Jung. "Story Embedding: Learning Distributed Representations of Stories based on Character Networks (Extended Abstract)." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/709.

Full text

Abstract:

This study aims to represent stories in narrative works (i.e., creative works that contain stories) with a fixed-length vector. We apply subgraph-based graph embedding models to dynamic social networks of characters that appeared in stories (character networks). We suppose that interactions between characters reflect the content of stories. We discretize the interactions by discovering the subgraphs and learn representations of stories by predicting occurrences of the subgraphs in corresponding character networks. We find subgraphs rooted in each character on each scene in multiple scales, usi

APA, Harvard, Vancouver, ISO, and other styles

6

Ding, Huafeng, and Zhen Huang. "Isomorphism Identification of Graphs of Kinematic Chains." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-34148.

Full text

Abstract:

Isomorphism identification of graphs is one of the most important and challenging problems in the fields of mathematics, computer science and mechanisms. This paper attempts to solve the problem by finding a unique representation of graphs. First, the perimeter loop of a graph is identified from all the loops of the graph obtained through a new algorithm. From the perimeter loop a corresponding perimeter graph is derived, which renders the forms of the graph canonical. Then, by relabelling the perimeter graph, the canonical perimeter graph is obtained, reducing the adjacency matrices of a grap

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!