Volume number2002(88) 2002.9.19
An Algorit...

An Algorithm for Enumerating All Maximal Matchings of a Graph

Icons representing 記事

An Algorithm for Enumerating All Maximal Matchings of a Graph

Call No. (NDL)
Z14-1121
Bibliographic ID of National Diet Library
6326550
Material type
記事
Author
宇野 毅明
Publisher
東京 : 情報処理学会
Publication date
2002-09-19
Material Format
Paper
Journal name
情報処理学会研究報告 = IPSJ SIG technical reports 2002(88) 2002.9.19
Publication Page
p.43~50
View All

Holdings of Libraries in Japan

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

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.

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.

Paper

Material Type
記事
Author/Editor
宇野 毅明
Author Heading
Alternative Title
一般グラフの極大マッチングを列挙するアルゴリズム
Periodical title
情報処理学会研究報告 = IPSJ SIG technical reports
No. or year of volume/issue
2002(88) 2002.9.19
Volume
2002
Issue
88
Pages
43~50