메뉴 건너뛰기
Journal of Discrete Algorithms
Volumn 9, Issue 3, 2011, Pages 231-240
Parameterized complexity of even/odd subgraph problems
Author keywords

Color coding; Eulerian graphs; Even graphs; FPT algorithms; Odd graphs; Parameterized complexity; Random separation
Indexed keywords

COLOR-CODING; EULERIAN GRAPHS; EVEN GRAPHS; FPT ALGORITHMS; ODD GRAPHS; PARAMETERIZED COMPLEXITY; RANDOM SEPARATION;
EID: 79957873734     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2011.03.004     Document Type: Conference Paper
Times cited : (30)
References (14)
  • 2
    • 79957799985 scopus 로고    scopus 로고
    • Improved bounds on Bell numbers and on moments of sums of random variables
    • D. Berend, and T. Tassa Improved bounds on Bell numbers and on moments of sums of random variables Probability and Mathematical Statistics 30 2 2010 185 205
    • (2010) Probability and Mathematical Statistics , vol.30 , Issue.2 , pp. 185-205
    • Berend, D.1    Tassa, T.2
  • 4
    • 0000971678 scopus 로고    scopus 로고
    • Fixed-parameter tractability of graph modification problems for hereditary properties
    • DOI 10.1016/0020-0190(96)00050-6, PII S0020019096000506
    • L. Cai Fixed-parameter tractability of graph modification problems for hereditary properties Inform. Process. Lett. 58 4 1996 171 176 (Pubitemid 126374630)
    • (1996) Information Processing Letters , vol.58 , Issue.4 , pp. 171-176
    • Cai, L.1
  • 8
    • 0033301071 scopus 로고    scopus 로고
    • The parameterized complexity of some fundamental problems in coding theory
    • R.G. Downey, M.R. Fellows, A. Vardy, and G. Whittle The parameterized complexity of some fundamental problems in coding theory SIAM J. Comput. 29 1999 545 570
    • (1999) SIAM J. Comput. , vol.29 , pp. 545-570
    • Downey, R.G.1    Fellows, M.R.2    Vardy, A.3    Whittle, G.4
  • 10
    • 0037202068 scopus 로고    scopus 로고
    • Parameterized complexity of finding subgraphs with hereditary properties
    • DOI 10.1016/S0304-3975(01)00414-5, PII S0304397501004145
    • S. Khot, and V. Raman Parameterized complexity of finding subgraphs with hereditary properties Theoret. Comput. Sci. 289 2 2002 997 1008 (Pubitemid 35167694)
    • (2002) Theoretical Computer Science , vol.289 , Issue.2 , pp. 997-1008
    • Khot, S.1    Raman, V.2
  • 11
    • 0019001812 scopus 로고
    • The node-deletion problem for hereditary properties is NP-complete
    • DOI 10.1016/0022-0000(80)90060-4
    • J.M. Lewis, and M. Yannakakis The node-deletion problem for hereditary properties is NP-complete J. Comput. System Sci. 20 2 1980 219 230 (Pubitemid 11421552)
    • (1980) Journal of Computer and System Sciences , vol.20 , Issue.2 , pp. 219-230
    • Lewis John, M.1    Yannakakis Mihalis2
  • 13
    • 4544362724 scopus 로고    scopus 로고
    • Complexity classification of some edge modification problems
    • PII S0166218X00003917
    • A. Natanzon, R. Shamir, and R. Sharan Complexity classification of some edge modification problems Discrete Appl. Math. 113 1 2001 109 128 (Pubitemid 33732132)
    • (2001) Discrete Applied Mathematics , vol.113 , Issue.1 , pp. 109-128
    • Natanzon, A.1    Shamir, R.2    Sharan, R.3
  • 14
    • 0025507834 scopus 로고
    • The spatial complexity of oblivious k-probe hash functions
    • J.P. Schmidt, and A. Siegel The spatial complexity of oblivious k-probe hash functions SIAM J. Comput. 19 1990 775 786
    • (1990) SIAM J. Comput. , vol.19 , pp. 775-786
    • Schmidt, J.P.1    Siegel, A.2

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