Theory of 2-structures. II: Representation through labeled tree families
From MaRDI portal
Publication:913823
DOI10.1016/0304-3975(90)90130-AzbMath0701.05052OpenAlexW2006512646MaRDI QIDQ913823
Andrzej Ehrenfeucht, Grzegorz Rozenberg
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(90)90130-a
Related Items (35)
Clans and regions in 2-structures ⋮ Primitive 2-structures with the \((n-2)\)-property ⋮ A \(k\)-structure generalization of the theory of 2-structures ⋮ An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures ⋮ Combinatorial properties of texts ⋮ Indecomposable graphs ⋮ From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats ⋮ Complete edge-colored permutation graphs ⋮ Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees ⋮ Tree-representation of set families and applications to combinatorial decompositions ⋮ Modular decomposition of hypergraphs ⋮ PC trees and circular-ones arrangements. ⋮ Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs ⋮ Modules in Robinson Spaces ⋮ \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs ⋮ Partial (set) 2-structures. I: Basic notions and the representation problems ⋮ Partial (set) 2-structures. II: State spaces of concurrent systems ⋮ Primitivity is hereditary for 2-structures ⋮ A characterization of set representable labeled partial 2-structures through decompositions ⋮ A tight lower bound for primitivity in k-structures ⋮ Angular 2-structures ⋮ Characterization and complexity of uniformly nonprimitive labeled 2-structures ⋮ The definition in monadic second-order logic of modular decompositions of ordered graphs ⋮ T-structures, T-functions, and texts ⋮ Linear-time modular decomposition of directed graphs ⋮ The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations ⋮ Best match graphs and reconciliation of gene trees with species trees ⋮ Algorithmic aspects of a general modular decomposition theory ⋮ From modular decomposition trees to rooted median graphs ⋮ Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees ⋮ NLC2-DECOMPOSITION IN POLYNOMIAL TIME ⋮ Modular decomposition and transitive orientation ⋮ Incremental construction of 2-structures ⋮ Context-free text grammars ⋮ 3-uniform hypergraphs: modular decomposition and realization by tournaments
Cites Work
This page was built for publication: Theory of 2-structures. II: Representation through labeled tree families
