Incremental construction of 2-structures (Q1322177): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Andrzej Ehrenfeucht / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Tero J.Harju / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Grzegorz Rozenberg / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Martin Loebl / rank | |||
Normal rank | |||
Revision as of 20:37, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Incremental construction of 2-structures |
scientific article |
Statements
Incremental construction of 2-structures (English)
0 references
15 September 1994
0 references
A labeled 2-structure \(g\) is an edge-labeled directed graph with a reversibility condition on the labels. Each labeled 2-structure \(g\) can be represented as a tree. The trees arising this way are characterized and a polynomial algorithm to recognize them is given.
0 references
graph
0 references
labeled 2-structure
0 references
directed graph
0 references
labels
0 references
tree
0 references
polynomial algorithm
0 references
