博士論文

Algorithms and Graph-Theoretic Characterizations of Problems in Matching Under Preferences

Icons representing 博士論文
The cover of this title could differ from library to library. Link to Help Page

Algorithms and Graph-Theoretic Characterizations of Problems in Matching Under Preferences

Persistent ID (NDL)
info:ndljp/pid/12302290
Material type
博士論文
Author
Ruangwises, Sutheeほか
Publisher
-
Publication date
2020-09
Material Format
Digital
Capacity, size, etc.
-
Name of awarding university/degree
東京工業大学,博士(理学)
View All

Notes on use at the National Diet Library

Notes on use

Note (General):

Matching under preferences is one of the most actively studied problems in theoretical computer science. The general objective of this problem is to m...

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.

Digital

Material Type
博士論文
Author/Editor
Ruangwises, Suthee
RUANGWISES, Suthee
Publication Date
2020-09
Publication Date (W3CDTF)
2020-09
Degree grantor/type
東京工業大学
Date Granted
2020-09-25
Date Granted (W3CDTF)
2020-09-25
Dissertation Number
甲第11573号