SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2387, Issue , 2002, Pages 238-248

Maximum flows and critical vertices in AND/OR graphs(Extended abstract)

(2) Desmedt, Yvo a,b Wang, Yongge c

a Florida State University (United States)

b UNIVERSITY OF LONDON (United Kingdom)

c University of North Carolina at Charlotte (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVES; GRAPH ALGORITHMS; NP-HARD; POLYNOMIAL APPROXIMATION;

AND/OR GRAPHS; EXTENDED ABSTRACTS; FOLLOWING PROBLEM; MANUFACTURING PROCESS; MAXIMUM FLOWS; MODEL PROBLEMS; POLYNOMIAL-TIME ALGORITHMS; RELATIVE COMPLEXITY;

FLOW GRAPHS;

EID: 84949791958 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/3-540-45655-4_27 Document Type: Conference Paper

Times cited : (9)

References (10)

1
- 84958644011
- Using approximation hardness to achieve dependable computation
- LNCS 1518, Springer Verlag
- M. Burmester, Y. Desmedt, and Y Wang. Using approximation hardness to achieve dependable computation. In: Proc. RANDOM’98, pages 172-186. LNCS 1518, Springer Verlag, 1998.
- (1998) Proc. RANDOM’98 , pp. 172-186
- Burmester, M.¹ Desmedt, Y.² Wang, Y.³

2
- 0000081639
- An admissible and optimal algorithm for searching AND/OR graphs
- C. L. Chang and J. R. Slagle. An admissible and optimal algorithm for searching AND/OR graphs. Artificial Intelligence, 2:117-128, 1971.
- (1971) Artificial Intelligence , vol.2 , pp. 117-128
- Chang, C.L.¹ Slagle, J.R.²

3
- 84957946170
- Princeton University Press, Princeton, NJ
- L.R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
- (1962) Flows in Networks
- Ford, L.R.¹ Fulkerson, D.R.²

4
- 0003603813
- W. H. Freeman and Company, San Francisco
- M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco, 1979.
- (1979) Computers and Intractability: A Guide to the Theory of Np-Completeness
- Garey, M.R.¹ Johnson, D.S.²

5
- 0004201432
- John Wiley & Sons Ltd., New York
- M. Gondran and M. Minoux. Graphs and Algorithms. John Wiley & Sons Ltd., New York, 1984.
- (1984) Graphs and Algorithms
- Gondran, M.¹ Minoux, M.²

6
- 0030361694
- Best first search algorithm in AND/OR graphs with cycles
- D. Hvalica. Best first search algorithm in AND/OR graphs with cycles. J. of Algorithms, 21:102-110, 1996.
- (1996) J. Of Algorithms , vol.21 , pp. 102-110
- Hvalica, D.¹

7
- 0001476310
- Additive AND/OR graphs
- Morgan Kaufmann Publishers, Inc
- A. Martelli and U. Montanari. Additive AND/OR graphs. In Proceedings of the Third International Joint Conference on Artificial Intelligence, pages 1-11, Morgan Kaufmann Publishers, Inc., 1973.
- (1973) Proceedings of the Third International Joint Conference on Artificial Intelligence , pp. 1-11
- Martelli, A.¹ Montanari, U.²

8
- 0004219017
- Tioga
- N. J. Nilsson. Principles of Artificial Intelligence. Tioga, 1980.
- (1980) Principles of Artificial Intelligence
- Nilsson, N.J.¹

9
- 0001223006
- Computationally related problems
- S. Sahni. Computationally related problems. SIAM J. Comput., 3:262-279, 1974.
- (1974) SIAM J. Comput. , vol.3 , pp. 262-279
- Sahni, S.¹

10
- 0039768535
- NP-Hardness of dependable computation with multiple inputs
- Y. Wang, Y. Desmedt, and M. Burmester. NP-Hardness of dependable computation with multiple inputs. Fundamenta Informaticae, 42(1):61-73, 2000.
- (2000) Fundamenta Informaticae , vol.42 , Issue.1 , pp. 61-73
- Wang, Y.¹ Desmedt, Y.² Burmester, M.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.