BSD Portsmath/kamis 2.1 DragonFly
Maximum independent sets and vertex covers of large sparse graphs
- System
- DragonFly
- Repository
- DPorts
- Maintainer
- [email protected] (as in FreeBSD)
- License
- MIT
- Categories
- math
- Package size
- 665.7 KiB, 5128.0 KiB installed
Description
KaMIS (Karlsruhe Maximum Independent Sets) is an open source project finding maximum independent sets and vertex covers of large sparse graphs.
Given a graph G=(V,E), the goal of the maximum independent set problem is to compute a maximum cardinality set of vertices I, such that no vertices in the set are adjacent to one another. Such a set is called a maximum independent set. The problem is NP-hard and particularly difficult to solve in large sparse graphs.
In the other systems
| System | Port | Version |
|---|---|---|
| DragonFly | math/kamis | 2.1 |
| FreeBSD | math/kamis | 3.2 |
| HardenedBSD | math/kamis | 3.2 |
| GhostBSD | math/kamis | 3.2 |
Install
Binary package:
pkg install kamisFrom DPorts:
cd /usr/dports/math/kamis && make install cleanDependencies
No port depends on this one.