주제분류(KDC/DDC) |
전산공학
|
549
|
19
|
|
주제어 |
"lightpathrouting,wavelengtha ...
|
1
|
1
|
|
"minimumfeedback edge set pro ...
|
1
|
1
|
|
activityonarc
|
1
|
1
|
|
activityonnode
|
1
|
1
|
|
adjacency graph
|
1
|
1
|
|
adjacent
|
1
|
1
|
|
ascending sort
|
1
|
1
|
|
assembly line
|
1
|
1
|
|
balanced and unbalanced assig ...
|
1
|
1
|
|
bin packing
|
1
|
1
|
|
candidateclique
|
1
|
1
|
|
closedneighborhood
|
1
|
1
|
|
connectedds
|
1
|
1
|
|
coveredpopulation
|
1
|
1
|
|
crews
|
1
|
1
|
|
degreeconstrained
|
2
|
2
|
|
descendingorder
|
1
|
1
|
|
dijkstra"
|
1
|
1
|
|
domaticnumber
|
2
|
2
|
|
dual-path
|
1
|
1
|
|
dual-pathcompetition
|
2
|
2
|
|
earth-moonproblem
|
1
|
1
|
|
edgeexchange
|
1
|
1
|
|
edgeswap
|
1
|
1
|
|
empires
|
1
|
1
|
|
exactcover
|
1
|
1
|
|
formulatedfeedmixture
|
1
|
1
|
|
gsmtransmitter
|
1
|
1
|
|
independentds
|
1
|
1
|
|
intersatellitelink
|
1
|
1
|
|
jobshopscheduling
|
1
|
1
|
|
k-optedgeswap
|
1
|
1
|
|
machine dedication
|
1
|
1
|
|
minimumproductcost
|
1
|
1
|
|
nutritionalcomponentsconstrai ...
|
1
|
1
|
|
one-sided optimization
|
1
|
1
|
|
openshopscheduling
|
1
|
1
|
|
out-degreeandin-degree
|
1
|
1
|
|
path merge and partition
|
1
|
1
|
|
point-to-pointshortestpathsea ...
|
1
|
1
|
|
polynomial time algorithm
|
1
|
1
|
|
pre-marshalling
|
1
|
1
|
|
projectnetwork
|
1
|
1
|
|
proper set
|
1
|
1
|
|
reassignment
|
1
|
1
|
|
rigging elections
|
1
|
1
|
|
runwayassignmentproblem
|
1
|
1
|
|
salgorithm
|
1
|
1
|
|
stable roommates problem
|
1
|
1
|
|
subdividedpixels
|
1
|
1
|
|
transit cost
|
1
|
1
|
|
transittime
|
1
|
1
|
|
transportation simplex method
|
1
|
1
|
|
tsap
|
1
|
1
|
|
variabledomain
|
1
|
1
|
|
간선 교환 (k-opt)
|
1
|
1
|
|
광 경로설정
|
1
|
1
|
|
구성 알고리즘
|
1
|
1
|
|
도메틱 수
|
1
|
1
|
|
독립 지배집합
|
1
|
1
|
|
독립집합
|
1
|
1
|
|
상자 채우기
|
2
|
2
|
|
시설 위치
|
1
|
1
|
|
연결 지배집합
|
1
|
1
|
|
지배집합
|
1
|
1
|
|
차수제약
|
1
|
1
|
|
최단거리
|
1
|
1
|
|
최대 매칭
|
1
|
1
|
|
최대차수
|
1
|
1
|
|
최소 가중치 매칭
|
1
|
1
|
|
최소 되먹임 간선 집합 문제
|
1
|
1
|
|
파장 배정
|
1
|
1
|
|
후보 클릭
|
1
|
1
|
|
hamiltonianpath
|
4
|
3
|
|
chromaticnumber
|
3
|
2
|
|
hungarianalgorithm
|
3
|
2
|
|
maximumclique
|
3
|
2
|
|
maximummatching
|
3
|
2
|
|
minimum weight matching
|
3
|
2
|
|
switch mode
|
3
|
2
|
|
time slot
|
3
|
2
|
|
Mesh type
|
2
|
1
|
|
batch processing
|
2
|
1
|
|
binpacking
|
6
|
3
|
|
cardinality
|
6
|
3
|
|
identicalprocessingmachines
|
2
|
1
|
|
independent set
|
2
|
1
|
|
marriageproblem
|
4
|
2
|
|
max-flow/min-distance
|
2
|
1
|
|
minimization of delays
|
2
|
1
|
|
multiple layer
|
2
|
1
|
|
np-완전
|
2
|
1
|
|
ramsey number
|
2
|
1
|
|
separationtime
|
2
|
1
|
|
smoking in their daily lives
|
2
|
1
|
|
social-psychological characte ...
|
2
|
1
|
|
social-relational characteris ...
|
2
|
1
|
|
targettime
|
2
|
1
|
|
결혼문제
|
2
|
1
|
|
배정
|
2
|
1
|
|
원소 개수
|
2
|
1
|
|
이중경로
|
2
|
1
|
|
채색 수
|
2
|
1
|
|
최대 클릭
|
2
|
1
|
|
해밀턴 경로
|
2
|
1
|
|
dominatingset
|
5
|
2
|
|
Outer-inner diameter(내 외경 ...
|
3
|
1
|
|
Random type
|
3
|
1
|
|
bay
|
3
|
1
|
|
constructivealgorithm
|
3
|
1
|
|
criticalpathmethod
|
3
|
1
|
|
edgedirection
|
3
|
1
|
|
lap
|
3
|
1
|
|
maximumdegree
|
3
|
1
|
|
minimum cost
|
6
|
2
|
|
process capability
|
3
|
1
|
|
set cover
|
6
|
2
|
|
shortest distance
|
3
|
1
|
|
swap optimization
|
3
|
1
|
|
tsm
|
3
|
1
|
|
사회관계적 특성
|
3
|
1
|
|
makespan
|
19
|
6
|
|
divide-and-conquer
|
11
|
3
|
|
photolithography
|
4
|
1
|
|
swap
|
13
|
3
|
|
minimum spanning tree
|
18
|
4
|
|
차수
|
9
|
2
|
|
np-complete
|
14
|
3
|
|
arrival
|
5
|
1
|
|
completegraph
|
5
|
1
|
|
criticalpath
|
5
|
1
|
|
departure
|
5
|
1
|
|
swap
|
5
|
1
|
|
symmetric
|
5
|
1
|
|
분할정복
|
5
|
1
|
|
incompatibility
|
6
|
1
|
|
lowerbound
|
6
|
1
|
|
corelation
|
7
|
1
|
|
degree
|
35
|
5
|
|
tasks
|
7
|
1
|
|
수송문제
|
7
|
1
|
|
최소신장트리
|
14
|
2
|
|
tier
|
8
|
1
|
|
greedyalgorithm
|
17
|
2
|
|
load balance
|
9
|
1
|
|
shortest path
|
9
|
1
|
|
부적합성
|
9
|
1
|
|
facility location
|
10
|
1
|
|
transportation problem
|
10
|
1
|
|
majority
|
11
|
1
|
|
median
|
13
|
1
|
|
threshold value
|
14
|
1
|
|
polycarbonate(폴리카보네이트 ...
|
15
|
1
|
|
asymmetric
|
16
|
1
|
|
process capability
|
17
|
1
|
|
assignment
|
38
|
2
|
|
stack
|
19
|
1
|
|
location selection
|
20
|
1
|
|
decision
|
23
|
1
|
|
qap
|
23
|
1
|
|
bottleneck
|
25
|
1
|
|
linear programming
|
29
|
1
|
|
선형계획법
|
31
|
1
|
|
heuristics
|
32
|
1
|
|
photolithography
|
33
|
1
|
|
matching
|
44
|
1
|
|
budget
|
45
|
1
|
|
neighborhood
|
45
|
1
|
|
image quality
|
47
|
1
|
|
교환
|
48
|
1
|
|
duration
|
108
|
2
|
|
evaluation index
|
58
|
1
|
|
capacity
|
62
|
1
|
|
distance
|
83
|
1
|
|
interpolation
|
86
|
1
|
|
휴리스틱
|
81
|
1
|
|
minority
|
111
|
1
|
|
preference
|
347
|
3
|
|
thickness
|
123
|
1
|
|
weight
|
142
|
1
|
|
가중치
|
135
|
1
|
|
frequency
|
282
|
1
|
|
optimization
|
1,071
|
2
|
|
선호도
|
447
|
1
|
|
유아교사
|
1,071
|
1
|
|
계 |
|
5,837 |
251 |
|
* 주제로 분류 되지 않은 논문건수 |
|
0 |
|