MARC 닫기
00397nam ac200169 k 4500
000003579577
20220101120000
ta
010731s1990 US 000 eng
▼a 211070
▼c 211070
▼l WM0003025219
▼v 450
▼a QA75.5
▼a QA75.5
▼b L4
▼c 450
▼a ALGORITHMS/
▼d ASANO,T
▼a BERLIN:
▼b SPRINGER-VERLAG,
▼c 1990.
▼a 478p.
▼a ASANO,T
▼a 단행본
WMO199925310
권 호 : 478
발행년 : 1990
서 명 : ALGORITHMS
발행처 : ASANO,T
목차
1. RECENT PROGRESS IN STRING ALGORITHMS
2. SELECTION NETWORKS
3. COMPUTING EDGE-CONNECTIVITY IN MULTIPLE AND CAPACITED GRAPHS
4. EFFICIENT SEQUENTIAL AND PARALLEL ALGORITHMS FOR PLANAR MINIMUM COST
5. FLOW
6. STRUCTURAL ANALYSES ON THE COMPLEXITY OF INVERTING FUNCTIONS
7. ORACLES VERSUS PROOF TECHNIQUES THAT DO NOT RELATIVIZE
8. 20-RELATIVE NEIGHBORHOOD GRAPHS ARE HAMILTONIAN
9. THE K-GABRIEL GRAPHS AND THEIR APPLICATIONS
10. PARALLEL ALGORITHMS FOR GENERATING SUBSETS AND SET PARTITIONS
11. PARALLEL ALGORITHMS FOR LINKED LIST AND BEYOND
12. LOCAL TOURNAMENTS AND PROPER CIRCULAR ARE GRAPHS
13. FAST ALGORITHMS FOR THE DOMINATING SET PROBLEM ON PERMUTATION
14. GRAPHS
15. TWO PROBABILISTIC RESULTS ON MERGING
서평쓰기