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. Join-tre...
-д хадгалсан:
| Үндсэн зохиолч: | |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
Logical Methods in Computer Science e.V.
2017-07-01
|
| Цуврал: | Logical Methods in Computer Science |
| Нөхцлүүд: | |
| Онлайн хандалт: | https://lmcs.episciences.org/2050/pdf |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|