"A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking ..."

Shin-ichi Nakayama, Shigeru Masuyama (2006)

> Home

Details and statistics

DOI: 10.1093/IETISY/E89-D.8.2357

access: closed

type: Journal Article

metadata version: 2020-04-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ieicet/NakayamaM06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/NakayamaM06
Shin-ichi Nakayama, Shigeru Masuyama:
A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs. IEICE Trans. Inf. Syst. 89-D(8): 2357-2363 (2006)

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.