메뉴 건너뛰기




Volumn 6942 LNCS, Issue , 2011, Pages 358-369

Fast sub-exponential algorithms and compactness in planar graphs

Author keywords

Branchwidth; Parameterized Algorithms; Planar Graphs

Indexed keywords

BIDIMENSIONALITY THEORY; BRANCHWIDTH; NEW THEORY; PARAMETERIZED ALGORITHM; PARAMETERIZED PROBLEMS; PLANAR GRAPH; RUNNING TIME; STEP ALGORITHMS; SUB-EXPONENTIAL ALGORITHMS; VERTEX SET;

EID: 80052785445     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23719-5_31     Document Type: Conference Paper
Times cited : (10)

References (37)
  • 1
    • 0037507853 scopus 로고    scopus 로고
    • Fixed parameter algorithms for dominating set and related problems on planar graphs
    • Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33, 461-493 (2002)
    • (2002) Algorithmica , vol.33 , pp. 461-493
    • Alber, J.1    Bodlaender, H.L.2    Fernau, H.3    Kloks, T.4    Niedermeier, R.5
  • 2
    • 70350583551 scopus 로고    scopus 로고
    • Fast FAST
    • Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) LNCS Springer, Heidelberg
    • Alon, N., Lokshtanov, D., Saurabh, S.: Fast FAST. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 49-58. Springer, Heidelberg (2009)
    • (2009) ICALP 2009 , vol.5555 , pp. 49-58
    • Alon, N.1    Lokshtanov, D.2    Saurabh, S.3
  • 5
    • 0347622466 scopus 로고    scopus 로고
    • On the existence of subexponential parameterized algorithms
    • Cai, L., Juedes, D.: On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences 67, 789-807 (2003)
    • (2003) Journal of Computer and System Sciences , vol.67 , pp. 789-807
    • Cai, L.1    Juedes, D.2
  • 6
    • 34250190430 scopus 로고    scopus 로고
    • Genus characterizes the complexity of graph problems: Some tight results
    • Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) LNCS Springer, Heidelberg
    • Chen, J., Kanj, I., Perkovic, L., Sedgwick, E., Xia, G.: Genus characterizes the complexity of graph problems: some tight results. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 845-856. Springer, Heidelberg (2003)
    • (2003) ICALP 2003 , vol.2719 , pp. 845-856
    • Chen, J.1    Kanj, I.2    Perkovic, L.3    Sedgwick, E.4    Xia, G.5
  • 7
    • 43249099091 scopus 로고    scopus 로고
    • The bidimensionality theory and its algorithmic applications
    • Demaine, E., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. The Computer Journal 51, 292-302 (2007)
    • (2007) The Computer Journal , vol.51 , pp. 292-302
    • Demaine, E.1    Hajiaghayi, M.2
  • 9
    • 84948770618 scopus 로고    scopus 로고
    • Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
    • Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ACM Trans. Algorithms 1, 33-47 (2005)
    • (2005) ACM Trans. Algorithms , vol.1 , pp. 33-47
    • Demaine, E.D.1    Fomin, F.V.2    Hajiaghayi, M.3    Thilikos, D.M.4
  • 10
    • 33745188001 scopus 로고    scopus 로고
    • Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
    • Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. Assoc. Comput. Mach. 52, 866-893 (2005)
    • (2005) J. Assoc. Comput. Mach. , vol.52 , pp. 866-893
    • Demaine, E.D.1    Fomin, F.V.2    Hajiaghayi, M.3    Thilikos, D.M.4
  • 12
    • 13644258065 scopus 로고    scopus 로고
    • Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors
    • Demaine, E.D., Hajiaghayi, M., Thilikos, D.M.: Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors. Algorithmica 41, 245-267 (2005)
    • (2005) Algorithmica , vol.41 , pp. 245-267
    • Demaine, E.D.1    Hajiaghayi, M.2    Thilikos, D.M.3
  • 13
    • 33750721672 scopus 로고    scopus 로고
    • Dynamic programming and fast matrix multiplication
    • Azar, Y., Erlebach, T. (eds.) LNCS Springer, Heidelberg
    • Dorn, F.: Dynamic Programming and Fast Matrix Multiplication. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 280-291. Springer, Heidelberg (2006)
    • (2006) ESA 2006 , vol.4168 , pp. 280-291
    • Dorn, F.1
  • 16
    • 84901396102 scopus 로고    scopus 로고
    • Graph separator algorithms: A refined analysis
    • Kučera, L. (ed.) LNCS Springer, Heidelberg
    • Fernau, H.: Graph Separator Algorithms: A Refined Analysis. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 186-197. Springer, Heidelberg (2002)
    • (2002) WG 2002 , vol.2573 , pp. 186-197
    • Fernau, H.1
  • 17
    • 21144445529 scopus 로고    scopus 로고
    • A geometric approach to parameterized algorithms for domination problems on planar graphs
    • Fiala, J., Koubek, V., Kratochvíl, J. (eds.) LNCS Springer, Heidelberg
    • Fernau, H., Juedes, D.: A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 488-499. Springer, Heidelberg (2004)
    • (2004) MFCS 2004 , vol.3153 , pp. 488-499
    • Fernau, H.1    Juedes, D.2
  • 18
    • 70350401895 scopus 로고    scopus 로고
    • Contraction bidimensionality: The accurate picture
    • Fiat, A., Sanders, P. (eds.) LNCS Springer, Heidelberg
    • Fomin, F.V., Golovach, P., Thilikos, D.M.: Contraction bidimensionality: The accurate picture. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 706-717. Springer, Heidelberg (2009)
    • (2009) ESA 2009 , vol.5757 , pp. 706-717
    • Fomin, F.V.1    Golovach, P.2    Thilikos, D.M.3
  • 21
    • 34247184732 scopus 로고    scopus 로고
    • Ominating sets in planar graphs: Branch-width and exponential speed-up
    • electronic
    • Fomin, F.V., Thilikos, D.M.: ominating sets in planar graphs: branch-width and exponential speed-up. SIAM J. Comput. 36, 281-309 (2006) (electronic)
    • (2006) SIAM J. Comput. , vol.36 , pp. 281-309
    • Fomin, F.V.1    Thilikos, D.M.2
  • 22
    • 33645293145 scopus 로고    scopus 로고
    • New upper bounds on the decomposability of planar graphs
    • Fomin, F.V., Thilikos, D.M.: New upper bounds on the decomposability of planar graphs. Journal of Graph Theory 51, 53-81 (2006)
    • (2006) Journal of Graph Theory , vol.51 , pp. 53-81
    • Fomin, F.V.1    Thilikos, D.M.2
  • 23
    • 80052796913 scopus 로고    scopus 로고
    • Subexponential parameterized algorithm for minimum fill-in
    • abs/1104.2230
    • Fomin, F.V., Villanger, Y.: Subexponential parameterized algorithm for minimum fill-in. CoRR, abs/1104.2230 (2011)
    • (2011) CoRR
    • Fomin, F.V.1    Villanger, Y.2
  • 25
    • 78650877925 scopus 로고    scopus 로고
    • Improved bounds on the planar branchwidth with respect to the largest grid minor size
    • Cheong, O., Chwa, K.-Y., Park, K. (eds.) Part II. LNCS Springer, Heidelberg
    • Gu, Q.-P., Tamaki, H.: Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol. 6507, pp. 85-96. Springer, Heidelberg (2010)
    • (2010) ISAAC 2010 , vol.6507 , pp. 85-96
    • Gu, Q.-P.1    Tamaki, H.2
  • 26
    • 38149015469 scopus 로고    scopus 로고
    • Linear problem kernels for NP-hard problems on planar graphs
    • Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) LNCS Springer, Heidelberg
    • Guo, J., Niedermeier, R.: Linear Problem Kernels for NP-Hard Problems on Planar Graphs. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 375-386. Springer, Heidelberg (2007)
    • (2007) ICALP 2007 , vol.4596 , pp. 375-386
    • Guo, J.1    Niedermeier, R.2
  • 27
    • 84956994784 scopus 로고    scopus 로고
    • Improved parameterized algorithms for planar dominating set
    • Diks, K., Rytter, W. (eds.) LNCS Springer, Heidelberg
    • Kanj, I., Perković, L.: Improved Parameterized Algorithms for Planar Dominating Set. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 399-410. Springer, Heidelberg (2002)
    • (2002) MFCS 2002 , vol.2420 , pp. 399-410
    • Kanj, I.1    Perković, L.2
  • 28
    • 84901427647 scopus 로고    scopus 로고
    • New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs
    • Kučera, L. (ed.) LNCS Springer, Heidelberg
    • Kloks, T., Lee, C.M., Liu, J.: New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 282-295. Springer, Heidelberg (2002)
    • (2002) WG 2002 , vol.2573 , pp. 282-295
    • Kloks, T.1    Lee, C.M.2    Liu, J.3
  • 29
    • 80052800732 scopus 로고    scopus 로고
    • Planar feedback vertex set and face cover: Combinatorial bounds and subexponential algorithms
    • Koutsonas, A., Thilikos, D.: Planar feedback vertex set and face cover: Combinatorial bounds and subexponential algorithms. Algorithmica, 1-17 (2010)
    • (2010) Algorithmica , pp. 1-17
    • Koutsonas, A.1    Thilikos, D.2
  • 30
    • 79955722390 scopus 로고    scopus 로고
    • Known algorithms on graphs of bounded treewidth are probably optimal
    • ACM-SIAM, San Francisco, California
    • Lokshtanov, D., Marx, D., Saurabh, S.: Known algorithms on graphs of bounded treewidth are probably optimal. In: 22st ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), pp. 777-789. ACM-SIAM, San Francisco, California (2011)
    • (2011) 22st ACM-SIAM Symposium on Discrete Algorithms (SODA 2011) , pp. 777-789
    • Lokshtanov, D.1    Marx, D.2    Saurabh, S.3
  • 32
    • 80052801113 scopus 로고    scopus 로고
    • Problems parameterized by treewidth tractable in single exponential time: A logical approach
    • April
    • Pilipczuk, M.: Problems parameterized by treewidth tractable in single exponential time: a logical approach. Tech. Rep. arXiv:1104.3057, Cornell University (April 2011)
    • (2011) Tech. Rep. ArXiv:1104.3057, Cornell University
    • Pilipczuk, M.1
  • 34
    • 0001227241 scopus 로고
    • Graph minors. X. Obstructions to tree-decomposition
    • Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52, 153-190 (1991)
    • (1991) J. Combin. Theory ser. B , vol.52 , pp. 153-190
    • Robertson, N.1    Seymour, P.D.2
  • 35
    • 0038521887 scopus 로고
    • Call routing and the ratcatcher
    • Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14, 217-241 (1994)
    • (1994) Combinatorica , vol.14 , pp. 217-241
    • Seymour, P.D.1    Thomas, R.2
  • 36
    • 78349253411 scopus 로고    scopus 로고
    • Faster approximation schemes and parameterized algorithms on H-minor-free and odd-minor-free graphs
    • Hliněńy, P., Kučera, A. (eds.) LNCS Springer, Heidelberg
    • Tazari, S.: Faster approximation schemes and parameterized algorithms on H-minor-free and odd-minor-free graphs. In: Hliněńy, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 641-652. Springer, Heidelberg (2010)
    • (2010) MFCS 2010 , vol.6281 , pp. 641-652
    • Tazari, S.1
  • 37
    • 70350423974 scopus 로고    scopus 로고
    • Dynamic programming on tree decompositions using generalised fast subset convolution
    • Fiat, A., Sanders, P. (eds.) LNCS Springer, Heidelberg
    • van Rooij, J.M.M., Bodlaender, H.L., Rossmanith, P.: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 566-577. Springer, Heidelberg (2009)
    • (2009) ESA 2009 , vol.5757 , pp. 566-577
    • Van Rooij, J.M.M.1    Bodlaender, H.L.2    Rossmanith, P.3


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