Finite Integer Index of Pathwidth and Treewidth
暂无分享,去创建一个
Jakub Gajarský | Jan Obdrzálek | Sebastian Ordyniak | Peter Rossmanith | Somnath Sikdar | Felix Reidl | Fernando Sánchez Villaamil | S. Sikdar | Jakub Gajarský | P. Rossmanith | F. Reidl | S. Ordyniak | J. Obdržálek
[1] Dimitrios M. Thilikos,et al. (Meta) Kernelization , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[2] Jakub Gajarský,et al. Kernelization Using Structural Parameters on Sparse Graph Classes , 2013, ESA.
[3] Bruno Courcelle,et al. An algebraic theory of graph reduction , 1993, JACM.
[4] Giuseppe F. Italiano,et al. Algorithms – ESA 2013 , 2013, Lecture Notes in Computer Science.
[5] Dimitrios M. Thilikos,et al. Bidimensionality and kernels , 2010, SODA '10.
[6] Christophe Paul,et al. Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions , 2013, ICALP.
[7] Frank Harary,et al. Graph Theory , 2016 .
[8] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..
[9] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[10] Jaroslav Nesetril,et al. Sparsity - Graphs, Structures, and Algorithms , 2012, Algorithms and combinatorics.
[11] Michael R. Fellows,et al. An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations , 1989, 30th Annual Symposium on Foundations of Computer Science.
[12] Ton Kloks,et al. Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs , 1993, J. Algorithms.