k(n-k) edge-disjoint spanning trees in arrangement graphs.">k(n-k) edge-disjoint spanning trees in arrangement graphs., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"Embedding k(n-k) edge-disjoint spanning trees in arrangement ..."

Chin-Tsai Lin (2003)

> Home

Details and statistics

DOI: 10.1016/S0743-7315(03)00107-2

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/Lin03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/Lin03
Chin-Tsai Lin:
Embedding k(n-k) edge-disjoint spanning trees in arrangement graphs. J. Parallel Distributed Comput. 63(12): 1277-1287 (2003)

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.