메뉴 건너뛰기




Volumn 5162 LNCS, Issue , 2008, Pages 335-346

Iterative compression and exact algorithms

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; DATA COMPRESSION; FOUNDATIONS;

EID: 54249133014     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85238-4_27     Document Type: Conference Paper
Times cited : (4)

References (23)
  • 1
    • 35448988064 scopus 로고    scopus 로고
    • Inclusion-Exclusion Algorithms for Counting Set Partitions
    • Björklund, A., Husfeldt, T.: Inclusion-Exclusion Algorithms for Counting Set Partitions. In: Proceedings of FOGS 2006, pp. 575-582 (2006)
    • (2006) Proceedings of FOGS 2006 , pp. 575-582
    • Björklund, A.1    Husfeldt, T.2
  • 3
    • 3042736584 scopus 로고    scopus 로고
    • Enumerating maximal independent sets with applications to graph colouring
    • Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett. 32(6), 547-556 (2004)
    • (2004) Oper. Res. Lett , vol.32 , Issue.6 , pp. 547-556
    • Byskov, J.M.1
  • 4
    • 57049178481 scopus 로고    scopus 로고
    • Chen, J., Liu, Y., Lu, S., Razgon, I., O'Sullivan, B.: A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem. In: Proceedings of STOC 2008, pp. 177-186 (2008)
    • Chen, J., Liu, Y., Lu, S., Razgon, I., O'Sullivan, B.: A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem. In: Proceedings of STOC 2008, pp. 177-186 (2008)
  • 6
    • 26844469337 scopus 로고    scopus 로고
    • 3) FPT algorithm for the undirected feedback vertex set problem. In: Proceedings of COCOON 2005, pp. 859-869 (2005)
    • 3) FPT algorithm for the undirected feedback vertex set problem. In: Proceedings of COCOON 2005, pp. 859-869 (2005)
  • 7
    • 0015330635 scopus 로고
    • Theoretical improvements in algorithmic efficiency for network flow problems
    • Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248-264 (1972)
    • (1972) J. ACM , vol.19 , Issue.2 , pp. 248-264
    • Edmonds, J.1    Karp, R.M.2
  • 9
    • 33746093487 scopus 로고    scopus 로고
    • Parameterized Algorithms for Hitting Set: The Weighted Case
    • Fernau, H.: Parameterized Algorithms for Hitting Set: The Weighted Case. In: Proceedings of CIAC 2006, pp. 332-343 (2006)
    • (2006) Proceedings of CIAC 2006 , pp. 332-343
    • Fernau, H.1
  • 10
    • 33244481489 scopus 로고    scopus 로고
    • 0.288 n) independent set algorithm. In: Proceedings of SODA 2006, pp. 18-25 (2006)
    • 0.288 n) independent set algorithm. In: Proceedings of SODA 2006, pp. 18-25 (2006)
  • 11
    • 38049088998 scopus 로고    scopus 로고
    • A More Effective Linear Kernelization for Cluster Editing
    • Guo, J.: A More Effective Linear Kernelization for Cluster Editing. In: Proceedings of ESCAPE 2007, pp. 36-47 (2007)
    • (2007) Proceedings of ESCAPE , pp. 36-47
    • Guo, J.1
  • 12
    • 33750457677 scopus 로고    scopus 로고
    • Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
    • Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8), 1386-1396 (2006)
    • (2006) J. Comput. Syst. Sci , vol.72 , Issue.8 , pp. 1386-1396
    • Guo, J.1    Gramm, J.2    Hüffner, F.3    Niedermeier, R.4    Wernicke, S.5
  • 13
    • 54249165932 scopus 로고    scopus 로고
    • 5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Computing 2(4), 225-231 (1973)
    • 5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Computing 2(4), 225-231 (1973)
  • 16
    • 38749119020 scopus 로고    scopus 로고
    • n) Algorithm for Graph Colouring and Other Partitioning Problems via Inclusion-Exclusion. In: Proceedings of FOCS 2006, pp. 583-590 (2006)
    • n) Algorithm for Graph Colouring and Other Partitioning Problems via Inclusion-Exclusion. In: Proceedings of FOCS 2006, pp. 583-590 (2006)
  • 17
    • 51249169586 scopus 로고
    • On Cliques in Graphs. Israel J
    • Moon, J.W., Mose, L.: On Cliques in Graphs. Israel J. Mathematics 3, 23-28 (1965)
    • (1965) Mathematics , vol.3 , pp. 23-28
    • Moon, J.W.1    Mose, L.2
  • 18
    • 37249000536 scopus 로고    scopus 로고
    • Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Trub, A., Böcker, S.: Exact and Heuristic Algorithms for Weighted Cluster Editing. In: Proceedings of Comput. Syst. Bioinformatics Conference 2007, 6(1), pp. 391-401 (2007)
    • Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Trub, A., Böcker, S.: Exact and Heuristic Algorithms for Weighted Cluster Editing. In: Proceedings of Comput. Syst. Bioinformatics Conference 2007, vol. 6(1), pp. 391-401 (2007)
  • 19
    • 36849093348 scopus 로고    scopus 로고
    • Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
    • Raman, V., Saurabh, S., Sikdar, S.: Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. Theory Comput. Syst. 41(3), 1432-4350 (2007)
    • (2007) Theory Comput. Syst , vol.41 , Issue.3 , pp. 1432-4350
    • Raman, V.1    Saurabh, S.2    Sikdar, S.3
  • 20
    • 2042441126 scopus 로고    scopus 로고
    • Finding odd cycle transversals
    • Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299-301 (2004)
    • (2004) Oper. Res. Lett , vol.32 , Issue.4 , pp. 299-301
    • Reed, B.A.1    Smith, K.2    Vetta, A.3
  • 21
    • 0001038743 scopus 로고
    • Algorithms for maximum independent sets
    • Robson, J.M.: Algorithms for maximum independent sets. J. Algorithms 7, 425-440 (1986)
    • (1986) J. Algorithms , vol.7 , pp. 425-440
    • Robson, J.M.1
  • 22
    • 0001513435 scopus 로고
    • Finding a maximum independent set
    • Tarjan, R., Trojanowski, A.: Finding a maximum independent set. SIAM J. Computing 6(3), 537-546 (1977)
    • (1977) SIAM J. Computing , vol.6 , Issue.3 , pp. 537-546
    • Tarjan, R.1    Trojanowski, A.2


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