Polynomial graph transformability
DOI10.1016/J.TCS.2011.12.039zbMath1243.68226OpenAlexW1990783777MaRDI QIDQ418788
Sabine Kuske, Hans-Joerg Kreowski
Publication date: 30 May 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.039
reductionNP-completenesssatisfiability problemgraph transformationpolynomial graph transformation unit
Graph polynomials (05C31) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph transformations. 4th international conference, ICGT 2008, Leicester, United Kingdom, September 7--13, 2008. Proceedings
- Graph transformations. Third international conference, ICGT 2006, Natal, Rio Grande do Norte, Brazil, September 17--23, 2006. Proceedings
- Graph transformations. Second international conference, ICGT 2004, Rome, Italy, September 28 -- October 2, 2004. Proceedings.
- Graph transformation. 1st international conference, ICGT 2002, Barcelona, Spain, October 7--12, 2002. Proceedings
- Graph transformations. 5th international conference, ICGT 2010, Enschede, The Netherlands, September 27 -- October 2, 2010. Proceedings
- Applications of graph transformations with industrial relevance. Third international symposium, AGTIVE 2007, Kassel, Germany, October 10--12, 2007. Revised selected and invited papers
- On Moore Graphs with Diameters 2 and 3
- Graph Transformation Units – An Overview
- Handbook of Graph Grammars and Computing by Graph Transformation
- Handbook of Graph Grammars and Computing by Graph Transformation
- SAT-Based Scalable Formal Verification Solutions
This page was built for publication: Polynomial graph transformability
