{"id":23181374,"url":"https://github.com/raoulluque/treewidth-heuristic-using-clique-graphs-benchmarks","last_synced_at":"2026-03-07T15:33:01.371Z","repository":{"id":245566970,"uuid":"818635759","full_name":"RaoulLuque/treewidth-heuristic-using-clique-graphs-benchmarks","owner":"RaoulLuque","description":"Benchmarks for https://github.com/RaoulLuque/treewidth-heuristic-clique-graph","archived":false,"fork":false,"pushed_at":"2024-08-20T16:00:14.000Z","size":4741,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-08-18T13:44:16.691Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"https://github.com/RaoulLuque/treewidth-heuristic-clique-graph","language":"Rust","has_issues":true,"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/RaoulLuque.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,"zenodo":null}},"created_at":"2024-06-22T12:03:44.000Z","updated_at":"2024-08-17T13:21:33.000Z","dependencies_parsed_at":"2025-08-18T13:33:53.664Z","dependency_job_id":"067c2be0-3675-4ed7-a39f-48f949a865d1","html_url":"https://github.com/RaoulLuque/treewidth-heuristic-using-clique-graphs-benchmarks","commit_stats":null,"previous_names":["raoulluque/treewidth-heuristic-clique-graph-benchmarks","raoulluque/treewidth-heuristic-using-clique-graphs-benchmarks"],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/RaoulLuque/treewidth-heuristic-using-clique-graphs-benchmarks","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RaoulLuque%2Ftreewidth-heuristic-using-clique-graphs-benchmarks","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RaoulLuque%2Ftreewidth-heuristic-using-clique-graphs-benchmarks/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RaoulLuque%2Ftreewidth-heuristic-using-clique-graphs-benchmarks/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RaoulLuque%2Ftreewidth-heuristic-using-clique-graphs-benchmarks/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/RaoulLuque","download_url":"https://codeload.github.com/RaoulLuque/treewidth-heuristic-using-clique-graphs-benchmarks/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RaoulLuque%2Ftreewidth-heuristic-using-clique-graphs-benchmarks/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30219541,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-07T14:02:48.375Z","status":"ssl_error","status_checked_at":"2026-03-07T14:02:43.192Z","response_time":53,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":[],"created_at":"2024-12-18T08:15:27.077Z","updated_at":"2026-03-07T15:33:01.331Z","avatar_url":"https://github.com/RaoulLuque.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Treewidth Heuristic using Clique Graph Benchmarks\n\nThis is the repository containing the benchmarks for the [treewidth heuristic using clique graphs](https://github.com/RaoulLuque/treewidth-heuristic-using-clique-graphs), a heuristic that computes an upper bound the treewidth of a graph using the clique graph.\n\n## Usage\n\nThe benchmarks are split into multiple packages which contain different benchmarks. The most important are the dimacs and k-tree benchmarks. The k-tree benchmark can be run via \u003cbr\u003e\n\n```cargo run --bin k-tree-benchmarks --release multithread``` \u003cbr\u003e\n\nHowever, this runs all benchmarks in ```TEST_SUITE``` in ```benchmark-suites/src/lib.rs```. For specific benchmarks from ```TEST_SUITE``` run \u003cbr\u003e\n\n```cargo run --bin k-tree-benchmarks --release multithread 1``` \u003cbr\u003e\n\nFor the benchmark at index 1 in ```TEST_SUITE```. Also note the multithread in the command. With this optional argument the arguments are run in multiple threads which results in way faster total computation time. For time critical benchmarks this argument can be omitted.\nSimilarly to above, the dimacs-benchmarks can be run with \u003cbr\u003e\n\n```cargo run --bin dimacs-benchmarks --release multithread``` \u003cbr\u003e\n\nThe results of the benchmarks can be found in the subdirectory ```benchmark_results``` of the respective package.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fraoulluque%2Ftreewidth-heuristic-using-clique-graphs-benchmarks","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fraoulluque%2Ftreewidth-heuristic-using-clique-graphs-benchmarks","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fraoulluque%2Ftreewidth-heuristic-using-clique-graphs-benchmarks/lists"}