Skip to main content Skip to main navigation menu Skip to site footer
IEICE Transactions on Information and Systems
  • Archives
  • About
    • About the Journal
    • Submissions
    • Privacy Statement
    • Contact
Search
  • Login
  1. Home /
  2. Archives /
  3. Vol. E89-D, No. 8 August 2006 /
  4. Invited Papers

A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs

Authors

  • Shin-ichi NAKAYAMA
  • Shigeru MASUYAMA

Downloads

  • Requires Subscription PDF

Published

2006-08-01

Issue

Vol. E89-D, No. 8 August 2006

Section

Invited Papers

Subscription

Login to access subscriber-only resources.

The Florida OJ service is provided through the FLVC Library Services. | FLVC Privacy Policy.

More information about the publishing system, Platform and Workflow by OJS/PKP.