Incremental construction of 2-structures

DOI10.1016/0012-365X(94)90107-4zbMath0796.05083MaRDI QIDQ1322177

Andrzej Ehrenfeucht, Tero J.Harju, Grzegorz Rozenberg

Publication date: 15 September 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

treegraphdirected graphpolynomial algorithmlabelslabeled 2-structure

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures ⋮ Characterization and complexity of uniformly nonprimitive labeled 2-structures ⋮ Theory of 2-structures ⋮ From modular decomposition trees to rooted median graphs

Cites Work

• Theory of 2-structures. I: Clans, basic subclasses, and morphisms
• Theory of 2-structures. II: Representation through labeled tree families
• Graphs indecomposable with respect to the X-join
• Partially ordered sets and their comparability graphs
• A Fast Algorithm for the Decomposition of Graphs and Posets
• A Homomorphism Theorem for Finite Graphs
• Transitiv orientierbare Graphen
• Modules of Coherent Binary Systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Incremental construction of 2-structures