Lower bounds for dynamic tree embedding in bipartite networks (Q1273880)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds for dynamic tree embedding in bipartite networks |
scientific article; zbMATH DE number 1236467
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for dynamic tree embedding in bipartite networks |
scientific article; zbMATH DE number 1236467 |
Statements
Lower bounds for dynamic tree embedding in bipartite networks (English)
0 references
6 January 1999
0 references
