Relevant bibliographies by topics / Uniquely labelled graphs

Academic literature on the topic 'Uniquely labelled graphs'

Author: Grafiati
Published: 4 June 2021
Last updated: 5 February 2022

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Uniquely labelled graphs.'

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 "Uniquely labelled graphs"

1

Fedorova, M. "Faithful group actions and Schreier graphs." Carpathian Mathematical Publications 9, no. 2 (January 3, 2018): 202–7. http://dx.doi.org/10.15330/cmp.9.2.202-207.

Full text
Abstract:
Each action of a finitely generated group on a set uniquely defines a labelled directed graph called the Schreier graph of the action. Schreier graphs are used mainly as a tool to establish geometrical and dynamical properties of corresponding group actions. In particilar, they are widely used in order to check amenability of different classed of groups. In the present paper Schreier graphs are utilized to construct new examples of faithful actions of free products of groups. Using Schreier graphs of group actions a sufficient condition for a group action to be faithful is presented. This result is applied to finite automaton actions on spaces of words i.e. actions defined by finite automata over finite alphabets. It is shown how to construct new faithful automaton presentations of groups upon given such a presentation. As an example a new countable series of faithful finite automaton presentations of free products of finite groups is constructed. The obtained results can be regarded as another way to construct new faithful actions of groups as soon as at least one such an action is provided.
APA, Harvard, Vancouver, ISO, and other styles
2

Trifunovic, Milan, Milos Stojkovic, Dragan Misic, Miroslav Trajanovic, and Miodrag Manic. "Recognizing Topological Analogy in Semantic Network." International Journal on Artificial Intelligence Tools 24, no. 03 (June 2015): 1550006. http://dx.doi.org/10.1142/s0218213015500062.

Full text
Abstract:
Recognizing topological analogy between the parts of semantic network seems to be very important step in the process of semantic categorization and interpretation of data that are embedded into the semantic network. Considering the semantic network as a set of graphs, recognition of topological analogy between the parts of semantic network can be treated as maximum common subgraph problem which falls in the group of exact graph matching problems. In this paper authors propose a new algorithm for maximum common subgraph detection aimed to a specific semantic network called Active Semantic Model (ASM). This semantic network can be represented as the set of labeled directed multigraphs with unique node labels. The structure of these graphs is specific because associations or edges are labeled with several attributes and some of them are related to nodes connected by edge. That kind of association-oriented structure enables associations or edges to play key role in the process of semantic categorization and interpretation of data. Furthermore, this kind of structure enables modeling semantic contexts in a form of semantically designated graphs (of associations). Proposed algorithm is capable of recognizing simultaneously maximum common subgraph of input graph and each of the graphs representing different contexts in ASM semantic network.
APA, Harvard, Vancouver, ISO, and other styles
3

Koponen, Vera. "A Limit Law of Almost l-partite Graphs." Journal of Symbolic Logic 78, no. 3 (September 2013): 911–36. http://dx.doi.org/10.2178/jsl.7803110.

Full text
Abstract:
AbstractFor integers l ≥ 1, d ≥ 0 we study (undirected) graphs with vertices 1, …, n such that the vertices can be partitioned into l parts such that every vertex has at most d neighbours in its own part. The set of all such graphs is denoted Pn (l, d). We prove a labelled first-order limit law, i.e., for every first-order sentence φ, the proportion of graphs in Pn (l, d) that satisfy φ converges as n → ∞. By combining this result with a result of Hundack, Prömel and Steger [12] we also prove that if 1 ≤ s1 ≤ … ≤ sl are integers, then Forb() has a labelled first-order limit law, where Forb() denotes the set of all graphs with vertices 1, …, n, for some n, in which there is no subgraph isomorphic to the complete (l + 1 )-partite graph with parts of sizes 1, s1, …, sl. In the course of doing this we also prove that there exists a first-order formula ξ, depending only on l and d, such that the proportion of ∈ Pn (l, d) with the following property approaches 1 as n → ∞: there is a unique partition of {1, …, n} into l parts such that every vertex has at most d neighbours in its own part, and this partition, viewed as an equivalence relation, is defined by ξ.
APA, Harvard, Vancouver, ISO, and other styles
4

Kim, Sun Ho. "Unique tracial state on the labeled graph C∗-algebra associated to the Thue–Morse sequence." International Journal of Mathematics 27, no. 05 (May 2016): 1650040. http://dx.doi.org/10.1142/s0129167x16500403.

Full text
Abstract:
We give a concrete formula for the unique faithful trace on the finite simple non-AF labeled graph [Formula: see text]-algebra [Formula: see text] associated to the Thue–Morse sequence [Formula: see text]. Our result provides an alternative proof of the existence of a labeled graph [Formula: see text]-algebra that is not Morita equivalent to any graph [Formula: see text]-algebras. Furthermore, we compute the [Formula: see text]-groups of [Formula: see text] using the path structure of the Thue–Morse sequence.
APA, Harvard, Vancouver, ISO, and other styles
5

MARTINSSON, ANDERS. "A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles." Combinatorics, Probability and Computing 28, no. 2 (January 8, 2019): 287–302. http://dx.doi.org/10.1017/s0963548318000391.

Full text
Abstract:
We consider a problem introduced by Mossel and Ross (‘Shotgun assembly of labeled graphs’, arXiv:1504.07682). Suppose a random n × n jigsaw puzzle is constructed by independently and uniformly choosing the shape of each ‘jig’ from q possibilities. We are given the shuffled pieces. Then, depending on q, what is the probability that we can reassemble the puzzle uniquely? We say that two solutions of a puzzle are similar if they only differ by a global rotation of the puzzle, permutation of duplicate pieces, and rotation of rotationally symmetric pieces. In this paper, we show that, with high probability, such a puzzle has at least two non-similar solutions when 2 ⩽ q ⩽ 2e−1/2n, all solutions are similar when q ⩾ (2+ϵ)n, and the solution is unique when q = ω(n).
APA, Harvard, Vancouver, ISO, and other styles
6

Lang, Joel, and Mirella Lapata. "Similarity-Driven Semantic Role Induction via Graph Partitioning." Computational Linguistics 40, no. 3 (September 2014): 633–69. http://dx.doi.org/10.1162/coli_a_00195.

Full text
Abstract:
As in many natural language processing tasks, data-driven models based on supervised learning have become the method of choice for semantic role labeling. These models are guaranteed to perform well when given sufficient amount of labeled training data. Producing this data is costly and time-consuming, however, thus raising the question of whether unsupervised methods offer a viable alternative. The working hypothesis of this article is that semantic roles can be induced without human supervision from a corpus of syntactically parsed sentences based on three linguistic principles: (1) arguments in the same syntactic position (within a specific linking) bear the same semantic role, (2) arguments within a clause bear a unique role, and (3) clusters representing the same semantic role should be more or less lexically and distributionally equivalent. We present a method that implements these principles and formalizes the task as a graph partitioning problem, whereby argument instances of a verb are represented as vertices in a graph whose edges express similarities between these instances. The graph consists of multiple edge layers, each one capturing a different aspect of argument-instance similarity, and we develop extensions of standard clustering algorithms for partitioning such multi-layer graphs. Experiments for English and German demonstrate that our approach is able to induce semantic role clusters that are consistently better than a strong baseline and are competitive with the state of the art.
APA, Harvard, Vancouver, ISO, and other styles
7

GROSSMAN, ROBERT, PAVAN KASTURI, DONALD HAMELBERG, and BING LIU. "AN EMPIRICAL STUDY OF THE UNIVERSAL CHEMICAL KEY ALGORITHM FOR ASSIGNING UNIQUE KEYS TO CHEMICAL COMPOUNDS." Journal of Bioinformatics and Computational Biology 02, no. 01 (March 2004): 155–71. http://dx.doi.org/10.1142/s021972000400051x.

Full text
Abstract:
In this paper, we introduce an algorithm that assigns an essentially unique key called the Universal Chemical Key (UCK) to molecular structures. The molecular structures are represented as labeled graphs whose nodes abstract atoms and whose edges abstract bonds. The algorithm was tested on 236,917 compounds obtained from the National Cancer Institute (NCI) database of chemical compounds. On this database, the UCK algorithm assigned unique keys for chemicals with distinct molecular structures.
APA, Harvard, Vancouver, ISO, and other styles
8

Bub, Sascha, Jakob Wolfram, Sebastian Stehle, Lara Petschick, and Ralf Schulz. "Graphing Ecotoxicology: The MAGIC Graph for Linking Environmental Data on Chemicals." Data 4, no. 1 (February 22, 2019): 34. http://dx.doi.org/10.3390/data4010034.

Full text
Abstract:
Assessing the impact of chemicals on the environment and addressing subsequent issues are two central challenges to their safe use. Environmental data are continuously expanding, requiring flexible, scalable, and extendable data management solutions that can harmonize multiple data sources with potentially differing nomenclatures or levels of specificity. Here, we present the methodological steps taken to construct a rule-based labeled property graph database, the “Meta-analysis of the Global Impact of Chemicals” (MAGIC) graph, for potential environmental impact chemicals (PEIC) and its subsequent application harmonizing multiple large-scale databases. The resulting data encompass 16,739 unique PEICs attributed to their corresponding chemical class, stereo-chemical information, valid synonyms, use types, unique identifiers (e.g., Chemical Abstract Service registry number CAS RN), and others. These data provide researchers with additional chemical information for a large amount of PEICs and can also be publicly accessed using a web interface. Our analysis has shown that data harmonization can increase up to 98% when using the MAGIC graph approach compared to relational data systems for datasets with different nomenclatures. The graph database system and its data appear more suitable for large-scale analysis where traditional (i.e., relational) data systems are reaching conceptional limitations.
APA, Harvard, Vancouver, ISO, and other styles
9

Moreira de Oliveira Jr, Montauban, Geovane Matheus Lemes Andrade, Eliel Roger da Silva, and Jean-Guillaume Eon. "Vertex collisions in 3-periodic nets of genus 4." Acta Crystallographica Section A Foundations and Advances 74, no. 5 (September 1, 2018): 600–607. http://dx.doi.org/10.1107/s2053273318009956.

Full text
Abstract:
Unstable nets, by definition, display vertex collisions in any barycentric representation, among which are approximate models for the associated crystal structures. This means that different vertex lattices happen to superimpose when every vertex of a periodic net is located at the centre of gravity of its first neighbours. Non-crystallographic nets are known to be unstable, but crystallographic nets can also be unstable and general conditions for instability are not known. Moreover, examples of unstable nets are still scarce. This article presents a systematic analysis of unstable 3-periodic nets of genus 4, satisfying the restrictions that, in a suitable basis, (i) their labelled quotient graph contains a spanning tree with zero voltage and (ii) voltage coordinates belong to the set {−1, 0, 1}. These nets have been defined by a unique circuit of null voltage in the quotient graph. They have been characterized through a shortest path between colliding vertices. The quotient graph and the nature of the net obtained after identification of colliding vertices, if known, are also provided. The complete list of the respective unstable nets, with a detailed description of the results, can be found in the supporting information.
APA, Harvard, Vancouver, ISO, and other styles
10

Ke-Qiang, Yang, Wang Yue-Jin, Zhang Jin-Jin, Wang Xi-Ping, Wan Yi-Zhen, and Zhang Jian-Xia. "Analysis of restriction sites and Southern blotting of two molecular markers linked to grape seedless gene." Chinese Journal of Agricultural Biotechnology 3, no. 1 (April 2006): 13–17. http://dx.doi.org/10.1079/cjb200581.

Full text
Abstract:
AbstractThe cloning and sequencing of two specific molecular markers linked to grape (Vitis vinifera) seedless gene indicated that the full lengths of the markers, 39970524-5-564 (GenBank accession number: AY327513) and 39970524-6-1538 (GenBank accession number: AY327514), were 564 bp and 1538 bp, respectively. The restriction sites of sequences 39970524-5-564 and 39970524-6-1538 were analysed with Wingene231 software. The results indicated that there were 29 and 130 restriction sites in 39970524-5-564 and 39970524-6-1538, respectively, digested by restriction enzymes with recognition sites of six or more than six bases. There was no cleavage site in 39970524-5-564 and there was one site at 135 bp of 39970524-6-1538 when these two markers were digested by EcoRI. Both markers can not be digested by HindIII. Therefore, the full length of 39970524-5-564 and of the two bands of 39970524-6-1538 (1400 bp and 135 bp) could be cut out from the pGEMR-T Easy Vector by EcoRI. The labelled DNA of 39970524-5-564, used as a probe for Southern blotting with genomic DNA from Red Globe, Flame Seedless, Thompson Seedless, four seedless hybrids and three seeded hybrids, showed a unique hybrid band present in all seedless individuals, but absent in all seeded individuals. It was further indicated that the specific marker 39970524-5-564 was derived from the genome of seedless grapes.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Uniquely labelled graphs"

1

Dickinson, Peter. "Graph based techniques for measurement of intranet dynamics." 2006. http://arrow.unisa.edu.au:8081/1959.8/45980.

Full text
Abstract:
This thesis develops a number of graph-based techniques that are capable of measuring the dynamic behaviour of a network and discusses their application in network management. By representing a computer network as a time series of uniquely labelled graphs, it is possible to measure the degree of change that has occurred between a pair of graphs, and hence the dynamics in a network. Concepts introduced include the median graph, intra- and inter- graph clustering, and hierarchical graph representations. The focus is on producing efficient algorithms and improved measures of network change. It is believed that these graph-based techniques for measuring network dynamics have great potential in network anomaly detection, and thus will improve reliability of enterprise intranets.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Uniquely labelled graphs"

1

Herber, Daniel R., and James T. Allison. "A Problem Class With Combined Architecture, Plant, and Control Design Applied to Vehicle Suspensions." In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-86213.

Full text
Abstract:
Here we describe a problem class with combined architecture, plant, and control design for dynamic engineering systems. The design problem class is characterized by architectures comprised of linear physical elements and nested co-design optimization problems employing linear-quadratic dynamic optimization. The select problem class leverages a number of existing theory and tools and is particularly attractive due to the symbiosis between labeled graph representations of architectures, dynamic models constructed from linear physical elements, linear-quadratic dynamic optimization, and the nested co-design solution strategy. A vehicle suspension case study is investigated and a specifically constructed architecture, plant, and control design problem is described. The result was the automated generation and co-design problem evaluation of 4,374 unique suspension architectures. The results demonstrate that changes to the vehicle suspension architecture can result in improved performance, but at the cost of increased mechanical complexity. Furthermore, the case study highlights a number of challenges associated with finding solutions to the considered class of design problems.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Uniquely labelled graphs' for particular source types:
Journal articles
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!

To the bibliography