Confluence in Data Reduction: Bridging Graph Transformation and Kernelization
暂无分享,去创建一个
Hartmut Ehrig | Rolf Niedermeier | Falk Hüffner | Claudia Ermel | Olga Runge | R. Niedermeier | Falk Hüffner | H. Ehrig | C. Ermel | Olga Runge
[1] Michal Pilipczuk,et al. Clique Cover and Graph Separation: New Incompressibility Results , 2011, TOCT.
[2] Marie-France Sagot,et al. Mod/Resc Parsimony Inference: Theory and application , 2010, Inf. Comput..
[3] H. Bodlaender. Kernelization: New Upper and Lower Bound Techniques , 2009, IWPEC.
[4] Rolf Niedermeier,et al. Data reduction and exact algorithms for clique cover , 2009, JEAL.
[5] Stefan Richter,et al. A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms , 2008, SIAM J. Discret. Math..
[6] Lucia Moura,et al. Covering arrays avoiding forbidden edges , 2008, Theor. Comput. Sci..
[7] Rolf Niedermeier,et al. Algorithms for compact letter displays: Comparison and evaluation , 2007, Comput. Stat. Data Anal..
[8] Rolf Niedermeier,et al. Invitation to data reduction and problem kernelization , 2007, SIGA.
[9] G. Gottlob,et al. A Backtracking-Based Algorithm for Computing Hypertree-Decompositions , 2007, ArXiv.
[10] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[11] Rolf Niedermeier,et al. INTRODUCTION TO FIXED-PARAMETER ALGORITHMS , 2006 .
[12] Ross M. McConnell,et al. Linear-Time Recognition of Circular-Arc Graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[13] Haiko Müller,et al. On the Tree-Degree of Graphs , 2001, WG.
[14] Hartmut Ehrig,et al. Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .
[15] Grzegorz Rozenberg,et al. Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .
[16] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[17] Hartmut Ehrig,et al. Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series) , 1992 .
[18] András Gyárfás,et al. A simple lower bound on edge coverings by cliques , 1990, Discret. Math..
[19] Annegret Habel,et al. Amalgamation of Graph Transformations: A Synchronization Mechanism , 1987, J. Comput. Syst. Sci..
[20] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.
[21] Chak-Kuen Wong,et al. Covering edges by cliques with regard to keyword conflicts and intersection graphs , 1978, CACM.
[22] Gerard Huet,et al. Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[23] Hartmut Ehrig,et al. Graph-Grammars: An Algebraic Approach , 1973, SWAT.
[24] M. Newman. On Theories with a Combinatorial Definition of "Equivalence" , 1942 .
[25] Albert Cohen,et al. GRAPHITE Two Years After First Lessons Learned From Real-World Polyhedral Compilation , 2010 .
[26] Hartmut Ehrig,et al. Fundamentals of Algebraic Graph Transformation , 2006, Monographs in Theoretical Computer Science. An EATCS Series.
[27] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[28] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .
[29] Detlef Plump,et al. Confluence of Graph Transformation Revisited , 2005, Processes, Terms and Cycles.
[30] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[31] Carl A. Gunter,et al. In handbook of theoretical computer science , 1990 .
[32] J. Orlin. Contentment in graph theory: Covering graphs with cliques , 1977 .