"A two-stages tree-searching algorithm for finding three completely ..."

Kung-Jui Pai et al. (2019)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2019.03.035

access: closed

type: Journal Article

metadata version: 2020-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/PaiCWC19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/PaiCWC19
Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang:
A two-stages tree-searching algorithm for finding three completely independent spanning trees. Theor. Comput. Sci. 784: 65-74 (2019)

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.