Algebraic and logical descriptions of generalized trees

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound of the rank-widths of its finite induced subgraphs...

Celý popis

Podrobná bibliografie

Vydáno v:	Logical methods in computer science Ročník 13, Issue 3; číslo 3
Hlavní autor:	Courcelle, Bruno
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Logical Methods in Computer Science Association 01.01.2017 Logical Methods in Computer Science e.V
Témata:	Computer Science computer science - logic in computer science Logic in Computer Science quasi-tree regular term ordered tree algebra monadic second-order logic join-tree Rank-width
ISSN:	1860-5974, 1860-5974
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!