"A linear-time algorithm for finding a paired 2-disjoint path cover in the ..."

Insung Ihm, Jung-Heum Park (2017)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2016.10.027

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/IhmP17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/IhmP17
Insung Ihm, Jung-Heum Park:
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph. Discret. Appl. Math. 218: 98-112 (2017)

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.