Chain Graphs have Unbounded Readability (Q6478037)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 900031216
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chain Graphs have Unbounded Readability |
scientific article; zbMATH DE number 900031216 |
Statements
15 October 2006
0 references
