Language:
English
繁體中文
Help
回圖書館首頁
手機版館藏查詢
Login
Search
Recommendations
ReaderScope
My Account
Help
Simple Search
Advanced Search
Public Library Lists
Public Reader Lists
AcademicReservedBook [CH]
BookLoanBillboard [CH]
BookReservedBillboard [CH]
Classification Browse [CH]
Exhibition [CH]
New books RSS feed [CH]
Personal Details
Saved Searches
Recommendations
Borrow/Reserve record
Reviews
Personal Lists
ETIBS
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
一個有效的演算法解決原始似星圖上的區間圖完成問題 = = An eff...
~
陳紀綱
Linked to FindBook
Google Book
Amazon
博客來
一個有效的演算法解決原始似星圖上的區間圖完成問題 = = An efficient algorithm for the interval graph completion problem on primitive starlike graphs /
Record Type:
Language materials, printed : Monograph/item
Title/Author:
一個有效的演算法解決原始似星圖上的區間圖完成問題 = / 陳紀綱撰
Reminder of title:
An efficient algorithm for the interval graph completion problem on primitive starlike graphs /
remainder title:
An efficient algorithm for the interval graph completion problem on primitive starlike graphs
Author:
陳紀綱
other author:
彭勝龍
Published:
民91[2002],
Description:
v,40葉 : 圖,表格 ; 30公分
Notes:
內容為英文
Subject:
演算法 -
Online resource:
http://etd.lib.ndhu.edu.tw/ETD-db/ETD-search-c/view_etd?URN=etd-0704102-012203PDF全文
一個有效的演算法解決原始似星圖上的區間圖完成問題 = = An efficient algorithm for the interval graph completion problem on primitive starlike graphs /
陳紀綱
一個有效的演算法解決原始似星圖上的區間圖完成問題 =
An efficient algorithm for the interval graph completion problem on primitive starlike graphs / An efficient algorithm for the interval graph completion problem on primitive starlike graphs陳紀綱撰 - 民91[2002] - v,40葉 : 圖,表格 ; 30公分
內容為英文
碩士論文--國立東華大學資訊工程研究所,2002
參考書目: 面 35-40
贈閱Subjects--Topical Terms:
2350080
演算法
一個有效的演算法解決原始似星圖上的區間圖完成問題 = = An efficient algorithm for the interval graph completion problem on primitive starlike graphs /
LDR
:00919nam 2200217 i 4500
001
73798
005
20110131160218.0
008
170414s2002 ch b 000 u eng d
035
$a
GE0031151
035
$a
73798
040
$a
東華
$b
chi
066
$c
$1
100
1
$a
陳紀綱
$e
撰
$3
2350079
245
1 0
$a
一個有效的演算法解決原始似星圖上的區間圖完成問題 =
$b
An efficient algorithm for the interval graph completion problem on primitive starlike graphs /
$c
陳紀綱撰
246
1 1
$a
An efficient algorithm for the interval graph completion problem on primitive starlike graphs
260
$c
民91[2002]
300
$a
v,40葉 :
$b
圖,表格 ;
$c
30公分
500
$a
內容為英文
500
$a
指導教授: 彭勝龍
502
$a
碩士論文--國立東華大學資訊工程研究所,2002
504
$a
參考書目: 面 35-40
563
$a
贈閱
650
7
$a
演算法
$2
csht
$3
2350080
700
1
$a
彭勝龍
$e
指導教授
$3
2319318
856
7
$u
http://etd.lib.ndhu.edu.tw/ETD-db/ETD-search-c/view_etd?URN=etd-0704102-012203
$z
PDF全文
$2
http
based on 0 review(s)
Location:
ALL
五樓論文區 (5F Theses & Dissertations)
Year:
Volume Number:
Items
1 records • Pages 1 •
1
Inventory Number
Location Name
Item Class
Material type
Call number
Usage Class
Loan Status
No. of reservations
Opac note
Attachments
GE0031151
五樓論文區 (5F Theses & Dissertations)
03.不外借_N
本校碩士論文
T 312.9 7522
一般使用(Normal)
On shelf
0
1 records • Pages 1 •
1
Multimedia
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login