{"id":21182631,"url":"https://github.com/fandreuz/bsc-thesis","last_synced_at":"2025-07-26T06:10:53.782Z","repository":{"id":107376949,"uuid":"281978498","full_name":"fandreuz/bsc-thesis","owner":"fandreuz","description":"BSc thesis, Computer Engineering","archived":false,"fork":false,"pushed_at":"2021-08-05T09:56:59.000Z","size":19778,"stargazers_count":2,"open_issues_count":3,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-21T12:32:51.820Z","etag":null,"topics":["algorithms","graph-algorithms","graph-theory","python"],"latest_commit_sha":null,"homepage":"","language":"TeX","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/fandreuz.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-07-23T14:45:49.000Z","updated_at":"2023-09-13T19:30:24.000Z","dependencies_parsed_at":null,"dependency_job_id":"e33d9771-1e8e-4c4b-9820-ddf837dbe0ad","html_url":"https://github.com/fandreuz/bsc-thesis","commit_stats":null,"previous_names":["fandreuz/bsc-thesis"],"tags_count":15,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fandreuz%2Fbsc-thesis","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fandreuz%2Fbsc-thesis/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fandreuz%2Fbsc-thesis/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fandreuz%2Fbsc-thesis/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/fandreuz","download_url":"https://codeload.github.com/fandreuz/bsc-thesis/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243639284,"owners_count":20323505,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","graph-algorithms","graph-theory","python"],"created_at":"2024-11-20T17:57:32.989Z","updated_at":"2025-03-14T19:44:14.064Z","avatar_url":"https://github.com/fandreuz.png","language":"TeX","funding_links":[],"categories":[],"sub_categories":[],"readme":"# My BSc thesis\n\n### Title\n\n`BisPy`: a Python package for the computation of the maximum bisimulation of\ndirected graphs.\n\n### Summary\n\nIn this thesis I analyse three algorithms for the computation of maximum\nbisimulation, which I also implemented in the Python package `BisPy` (available\n[here](https://github.com/fAndreuzzi/BisPy)).\n\n### PDF and slides\n\nThe PDF file is available [here](files/document.pdf) italian only. The slides\nwhich I used during the discussion of the thesis are [here](files/slides.pdf).\n\n### Word cloud\n![](res/word-cloud.png)\n\n### Bibliography\n\nThis is a reduced version of the list of references which I consulted:\n\n- Saha, Diptikalyan. \"An incremental bisimulation algorithm.\" International\n  Conference on Foundations of Software Technology and Theoretical Computer\n  Science. Springer, Berlin, Heidelberg, 2007.\n  [DOI](https://doi.org/10.1007/978-3-540-77050-3_17)\n- Dovier, Agostino, Carla Piazza, and Alberto Policriti. \"A fast bisimulation\n  algorithm.\" International Conference on Computer Aided Verification.\n  Springer, Berlin, Heidelberg, 2001.\n  [DOI](https://doi.org/10.1007/3-540-44585-4_8)\n- Gentilini, Raffaella, Carla Piazza, and Alberto Policriti. \"From bisimulation\n  to simulation: Coarsest partition problems.\" Journal of Automated Reasoning\n  31.1 (2003): 73-103. [DOI](https://doi.org/10.1023/A:1027328830731)\n- Paige, Robert, and Robert E. Tarjan. \"Three partition refinement algorithms.\"\n  SIAM Journal on Computing 16.6 (1987): 973-989.\n  [DOI](https://doi.org/10.1137/0216062)\n- Hopcroft, John. \"An n log n algorithm for minimizing states in a finite\n  automaton.\" Theory of machines and computations. Academic Press, 1971.\n  189-196.\n- Aczel, Peter. \"Non-well-founded sets.\" (1988).\n- Kanellakis, Paris C., and Scott A. Smolka. \"CCS expressions, finite state\n  processes, and three problems of equivalence.\" Information and computation\n  86.1 (1990): 43-68. [DOI](\u003chttps://doi.org/10.1016/0890-5401(90)90025-D\u003e)\n- Sharir, Micha. \"A strong-connectivity algorithm and its applications in data\n  flow analysis.\" Computers \u0026 Mathematics with Applications 7.1 (1981): 67-72.\n  [DOI](\u003chttps://doi.org/10.1016/0898-1221(81)90008-0\u003e)\n- Cormen, Thomas H., et al. Introduction to algorithms. MIT press, 2009.\n  (ISBN: 9780262533058)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffandreuz%2Fbsc-thesis","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffandreuz%2Fbsc-thesis","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffandreuz%2Fbsc-thesis/lists"}