Transformations of derivation sequences in graph grammars

Kreowski, Hans‐Jörg

doi:10.1007/3-540-08442-8_94

Cited by 15 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Candidates are operations like conflux and interchange that are based on independence including parallelization, sequentialization, and shift (cf. [9]).…”

Section: Discussionmentioning

confidence: 99%

A Graph-Transformational Approach for Proving the Correctness of Reductions between NP-Problems

Kreowski

Kuske

Lye

et al. 2022

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

The complexity class NP of decision problems that can be solved nondeterministically in polynomial time is of great theoretical and practical importance where the notion of polynomial-time reductions between NP-problems is a key concept for the study of NP. As many typical NP-problems are naturally described as graph problems, they and their reductions are obvious candidates to be investigated by graph-transformational means. In this paper, we propose such a graph-transformational approach for proving the correctness of reductions between NP-problems.

show abstract

“…Candidates are operations like conflux and interchange that are based on independence including parallelization, sequentialization, and shift (cf. [9]).…”

Section: Discussionmentioning

confidence: 99%

A Graph-Transformational Approach for Proving the Correctness of Reductions between NP-Problems

Kreowski

Kuske

Lye

et al. 2022

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…As shall be explained in section 6, adhesive categories with coproducts are highlevel replacement categories. In particular, we get the local Church-Rosser theorem [14,9].…”

Section: Local Church-rosser Theoremmentioning

confidence: 99%

“…In particular, several axioms were put forward in [11] in order to prove a local Church-Rosser theorem for such general rewrite systems. Additional axioms were needed to prove a general version of the so-called concurrency theorem [14].…”

Section: Introductionmentioning

confidence: 99%