Theory of 2-structures

DOI10.1007/3-540-60084-1_58MaRDI QIDQ4645162zbMATH OpenOpenAlexFDO

Authors Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg

Publication date 10 January 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60084-1_58

zbMATH Keywords

modular decompositionlocal transformationhierarchical representationedge classreversibility function

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Cites work

• A Fast Algorithm for the Decomposition of Graphs and Posets
• Angular 2-structures
• Characterization and complexity of uniformly nonprimitive labeled 2-structures
• Context-free text grammars
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Dynamic labeled 2-structures
• Incremental construction of 2-structures
• Incremental modular decomposition
• Invariants of inversive 2-structures on groups of labels
• Partial (set) 2-structures. II: State spaces of concurrent systems
• Permutable transformation semigroups
• Primitive 2-structures with the \((n-2)\)-property
• Primitivity is hereditary for 2-structures
• T-structures, T-functions, and texts
• Theory of 2-structures. I: Clans, basic subclasses, and morphisms

Cited in

(3)

• From modular decomposition trees to rooted median graphs
• The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
• \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs

This page was built for publication: Theory of 2-structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645162)