SCOPUS 정보 검색 플랫폼

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

Volumn 1443 LNCS, Issue , 1998, Pages 176-187

Independent sets with domination constraints

(3) Halldórsson, Magnús M a,c Kratochvil, Jan b Telle, Jan Ame c

a UNIVERSITY OF ICELAND (Iceland)

b CHARLES UNIVERSITY (Czech Republic)

c UNIVERSITY OF BERGEN (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; POLYNOMIAL APPROXIMATION;

APPROXIMATION RESULTS; INAPPROXIMABILITY; INDEPENDENT SET; MAXIMUM INDEPENDENT SETS; NONNEGATIVE INTEGERS; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; SET PACKING PROBLEM;

APPROXIMATION ALGORITHMS;

EID: 84878602553 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/bfb0055051 Document Type: Conference Paper

Times cited : (10)

References (10)

1
- 0001159084
- Approximating maximum independent sets by excluding subgraphs
- R. B. Boppana and M.M. Halldórsson, Approximating maximum independent sets by excluding subgraphs, BIT, 32 (1992), 180-196.
- (1992) BIT , vol.32 , pp. 180-196
- Boppana, R.B.¹ Halldórsson, M.M.²

2
- 0004127488
- Freeman, New York
- M. R. Garey and D. S. Johnson, Computers and Intractability (Freeman, New York, 1979).
- (1979) Computers and Intractability
- Garey, M.R.¹ Johnson, D.S.²

3
- 0027607736
- Approximating the minimum maximal independence number
- M.M. Halldórsson, Approximating the minimum maximal independence number, Information Processing Letters 46 (1993), 169-172.
- (1993) Information Processing Letters , vol.46 , pp. 169-172
- Halldórsson, M.M.¹

4
- 0030386107
- 1-ε
- 1-ε, In Proc. 37th IEEE Symp. on Found, of Comput. Sci., (1996), 627-636.
- (1996) Proc. 37th IEEE Symp. on Found, of Comput. Sci. , pp. 627-636
- Hâstad, J.¹

5
- 0030646744
- A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction
- S. Khanna, M. Sudan and D. P. Williamson, A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction. in Proc. 29th ACM Symp. on Theory of Computing, (1997), 11-20.
- (1997) Proc. 29th ACM Symp. on Theory of Computing , pp. 11-20
- Khanna, S.¹ Sudan, M.² Williamson, D.P.³

6
- 25744434974
- Academia Praha
- J. Kratochvíl, Perfect codes in general graphs, monograph, Academia Praha (1991).
- (1991) Perfect Codes in General Graphs, Monograph
- Kratochvíl, J.¹

7
- 0012232910
- Generalized domination in chordal graphs
- J. Kratochvíl, P. Manuel and M. Miller, Generalized domination in chordal graphs, Nordic Journal of Computing 2 (1995), 41-50
- (1995) Nordic Journal of Computing , vol.2 , pp. 41-50
- Kratochvíl, J.¹ Manuel, P.² Miller, M.³

8
- 0018053728
- The complexity of satisfiability problems
- T.J. Schaefer, The complexity of satisfiability problems, In Proc. 10th ACM Symp. on Theory of Computing (1978), 216-226.
- (1978) Proc. 10th ACM Symp. on Theory of Computing , pp. 216-226
- Schaefer, T.J.¹

9
- 0345995761
- Characterization of domination-type parameters in graphs
- J.A. Telle, Characterization of domination-type parameters in graphs, Proceedings of 24th Southeastern International Conference on Combinatorics, Graph Theory and Computing-Congressus Numerantium Vol.94 (1993), 9-16.
- (1993) Proceedings of 24th Southeastern International Conference on Combinatorics, Graph Theory and Computing-Congressus Numerantium , vol.94 , pp. 9-16
- Telle, J.A.¹

10
- 0141913290
- Complexity of domination-type problems in graphs
- J.A. Telle, Complexity of domination-type problems in graphs, Nordic Journal of Computing 1 (1994), 157-171.
- (1994) Nordic Journal of Computing , vol.1 , pp. 157-171
- Telle, J.A.¹

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