https://github.com/permutatriangle/hypergraphindependentsets
Programs for counting the number of independent sets in hypergraphs
https://github.com/permutatriangle/hypergraphindependentsets
Last synced: 12 months ago
JSON representation
Programs for counting the number of independent sets in hypergraphs
- Host: GitHub
- URL: https://github.com/permutatriangle/hypergraphindependentsets
- Owner: PermutaTriangle
- Created: 2016-03-04T02:50:26.000Z (over 10 years ago)
- Default Branch: master
- Last Pushed: 2016-03-08T15:58:27.000Z (over 10 years ago)
- Last Synced: 2025-01-05T12:30:43.789Z (over 1 year ago)
- Language: C++
- Size: 1.95 KB
- Stars: 1
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## Input format
~~~
..
..
..
..
~~~
Where `n` is the number of vertices, `m` is the number of constraints, `ci` is
the `i`:th constraint, and `cij` is the `j`:th vertex in the `i`:th constraint.
Say we have 10 vertices, and it is forbidden to include all of `0`, `1` and `2`
and it is forbidden to include both of `8` and `9`. Then the input should look
as follows:
~~~
10 2
0 1 2
8 9
~~~