On Token Swapping in Labeled Tree

2021 ◽  
Author(s):  
Malavika J ◽  
Shijo Scaria ◽  
Indulekha T S
Keyword(s):  
Labeled Tree

scholarly journals The Structure of Locally Finite Two-Connected Graphs

10.37236/1211 ◽  
1995 ◽  
Vol 2 (1) ◽  
Author(s):  
Carl Droms ◽  
Brigitte Servatius ◽  
Herman Servatius
Keyword(s):  
Connected Graph ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Locally Finite ◽  
Connected Graphs ◽  
Finite Graphs ◽  
Locally Finite Graphs ◽  
Necessary And Sufficient ◽  
Block Tree ◽  
Labeled Tree

We expand on Tutte's theory of $3$-blocks for $2$-connected graphs, generalizing it to apply to infinite, locally finite graphs, and giving necessary and sufficient conditions for a labeled tree to be the $3$-block tree of a $2$-connected graph.

Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison

2000 ◽  
pp. 479-490
Author(s):  
Ming-Yang Kao ◽  
Tak-Wah Lam ◽  
Wing-Kin Sung ◽  
Hing-Fung Ting
Keyword(s):  
Tree Comparison ◽  
Labeled Tree

3-D floorplanning using labeled tree and dual sequences

2008 ◽  
Author(s):  
Renshen Wang ◽  
Evangeline F. Y. Young ◽  
Yi Zhu ◽  
Fan Chung Graham ◽  
Ronald Graham ◽  
...  
Keyword(s):  
Labeled Tree ◽  
Dual Sequences

Structure and Metabolic-Flow Analysis of Molecular Complexity in a 13 C-Labeled Tree by 2D and 3D NMR

2016 ◽  
Vol 55 (20) ◽  
pp. 6000-6003 ◽  
Author(s):  
Takanori Komatsu ◽  
Risa Ohishi ◽  
Amiu Shino ◽  
Jun Kikuchi
Keyword(s):  
Flow Analysis ◽  
3D Nmr ◽  
Molecular Complexity ◽  
2D And 3D ◽  
Labeled Tree

Torsion-free abelian groups with optimal Scott families

2018 ◽  
Vol 18 (01) ◽  
pp. 1850002
Author(s):  
Alexander G. Melnikov
Keyword(s):  
Abelian Group ◽  
Free Abelian Group ◽  
Abelian Groups ◽  
Symbolic Logic ◽  
Technical Result ◽  
Torsion Free Abelian Group ◽  
Scott Family ◽  
Free Abelian Groups ◽  
Torsion Free ◽  
Labeled Tree

We prove that for any computable successor ordinal of the form [Formula: see text] [Formula: see text] limit and [Formula: see text] there exists computable torsion-free abelian group [Formula: see text]TFAG[Formula: see text] that is relatively [Formula: see text] -categorical and not [Formula: see text] -categorical. Equivalently, for any such [Formula: see text] there exists a computable TFAG whose initial segments are uniformly described by [Formula: see text] infinitary computable formulae up to automorphism (i.e. it has a c.e. uniformly [Formula: see text]-Scott family), and there is no syntactically simpler (c.e.) family of formulae that would capture these orbits. As far as we know, the problem of finding such optimal examples of (relatively) [Formula: see text]-categorical TFAGs for arbitrarily large [Formula: see text] was first raised by Goncharov at least 10 years ago, but it has resisted solution (see e.g. Problem 7.1 in survey [Computable abelian groups, Bull. Symbolic Logic 20(3) (2014) 315–356]). As a byproduct of the proof, we introduce an effective functor that transforms a [Formula: see text]-computable worthy labeled tree (to be defined) into a computable TFAG. We expect that this technical result will find further applications not necessarily related to categoricity questions.

HEURISTIC CLASSIFICATION OF OFFICE DOCUMENTS

1994 ◽  
Vol 03 (02) ◽  
pp. 233-265 ◽  
Author(s):  
XIAOLONG HAO ◽  
JASON T.L. WANG ◽  
MICHAEL P. BIEBER ◽  
PETER A. NG
Keyword(s):  
Conceptual Structure ◽  
Document Classification ◽  
Office Workers ◽  
Document Type ◽  
Major Function ◽  
Conceptual Structures ◽  
Heuristic Classification ◽  
Labeled Tree ◽  
Attribute Type

Document Processing Systems (DPSs) support office workers to manage information. Document classification is a major function of DPSs. By analyzing a document’s layout and conceptual structures, we present in this paper a sample-based approach to document classification. We represent a document’s layout structure by an ordered labeled tree through a procedure known as nested segmentation and represent the document’s conceptual structure by a set of attribute type pairs. The layout similarities between the document to be classified and sample documents are determined by a previously developed approximate tree matching toolkit. The conceptual similarities between the documents are determined by analyzing their contents and by calculating the degree of conceptual closeness. The document type is identified by computing both the layout and conceptual similarities between the document to be classified and the samples in the document sample base. Some experimental results are presented, which demonstrate the effectiveness of the proposed techniques.

Structure and Metabolic-Flow Analysis of Molecular Complexity in a 13 C-Labeled Tree by 2D and 3D NMR

2016 ◽  
Vol 128 (20) ◽  
pp. 6104-6107 ◽  
Author(s):  
Takanori Komatsu ◽  
Risa Ohishi ◽  
Amiu Shino ◽  
Jun Kikuchi
Keyword(s):  
Flow Analysis ◽  
3D Nmr ◽  
Molecular Complexity ◽  
2D And 3D ◽  
Labeled Tree

scholarly journals Theory of 2-structures, part II: Representation through labeled tree families

1990 ◽  
Vol 70 (3) ◽  
pp. 305-342 ◽  
Author(s):  
A. Ehrenfeucht ◽  
G. Rozenberg
Keyword(s):  
Labeled Tree
Sign in / Sign up

Export Citation Format

Share Document