"Lower Bounds for Dynamic Tree Embedding in Bipartite Networks."

Keqin Li et al. (1998)

> Home

Details and statistics

DOI: 10.1006/JPDC.1998.1475

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jpdc/LiPSYZ98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/LiPSYZ98
Keqin Li, Yi Pan, Hong Shen, Gilbert H. Young, Si-Qing Zheng:
Lower Bounds for Dynamic Tree Embedding in Bipartite Networks. J. Parallel Distributed Comput. 53(2): 119-143 (1998)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.