Help
Help
記事

A Polynomial Time Algorithm for Solving a 2-tuple Domination Problem on Permutation Graphs

Icons representing 記事

A Polynomial Time Algorithm for Solving a 2-tuple Domination Problem on Permutation Graphs

Call No. (NDL)
YH247-954
Bibliographic ID of National Diet Library
024731939
Material type
記事
Author
Shin-ichi NAKAYAMAほか
Publisher
[東京] : [電子情報通信学会]
Publication date
2013-07
Material Format
Recording Media
Journal name
回路とシステムワークショップ論文集 Workshop on Circuits and Systems 26:2013.7.29・30
Publication Page
p.231-236
View All

Holdings of Libraries in Japan

This page shows libraries in Japan other than the National Diet Library that hold the material.

List of Cooperating Institutions and Databases

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

  • CiNii Research

    Search Service
    You can check the holdings of institutions and databases with which CiNii Research is linked at the site of CiNii Research.
    Check the holdings of this book

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Recording Media

Material Type
記事
Title
A Polynomial Time Algorithm for Solving a 2-tuple Domination Problem on Permutation Graphs
Author/Editor
Shin-ichi NAKAYAMA
Shigeru MASUYAMA
Author Heading
Shin-ichi NAKAYAMA
Shigeru MASUYAMA
Periodical title
回路とシステムワークショップ論文集 Workshop on Circuits and Systems
No. or year of volume/issue
26:2013.7.29・30
Volume
26
Pages
231-236
Publication date of volume/issue (W3CDTF)
2013-07
Publication (Periodical Title)
[東京] : [電子情報通信学会]