Add pledge and author (#30)

* Add pledge and author

* Update README.md

Co-authored-by: Uwe Hernandez Acosta <szabo137@users.noreply.github.com>

---------

Co-authored-by: Uwe Hernandez Acosta <szabo137@users.noreply.github.com>

Project.toml

@@ -1,6 +1,6 @@
 name = "ComputableDAGs"
 uuid = "62933717-1c9d-4a3f-b06f-7ab7f17ca32d"
-authors = ["AntonReinhard <anton.reinhard@proton.me>"]
+authors = ["Anton Reinhard <a.reinhard@hzdr.de>", "Uwe Hernandez Acosta <u.hernandez@hzdr.de>"]
 version = "0.1.0"
 
 [deps]

README.md

@@ -29,3 +29,7 @@ We assume we have a (valid) DAG given. We can generate all initially possible gr
 Goal: For some operation, regenerate possible operations after that one has been applied, but without having to copy the entire graph. This would be helpful for optimization algorithms to try paths of optimizations and build up tree structures, like for example chess computers do.
 
 Idea: Keep the original graph, a list of possible operations at the current state, and a queue of applied operations together. The "actual" graph is then the original graph with all operations in the queue applied. We can push and pop new operations to/from the queue, automatically updating the graph's global metrics and possible optimizations from there.
+
+## Acknowledgements and Funding 
+
+This work was partly funded by the Center for Advanced Systems Understanding (CASUS) that is financed by Germany’s Federal Ministry of Education and Research (BMBF) and by the Saxon Ministry for Science, Culture and Tourism (SMWK) with tax funds on the basis of the budget approved by the Saxon State Parliament.