-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
e816f38
commit b7d009f
Showing
3 changed files
with
33 additions
and
8 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,6 +1,17 @@ | ||
| # OptimalBranchingCore | ||
|
|
||
| [](https://ArrogantGao.github.io/OptimalBranchingCore.jl/stable/) | ||
| [](https://ArrogantGao.github.io/OptimalBranchingCore.jl/dev/) | ||
| [](https://github.com/ArrogantGao/OptimalBranchingCore.jl/actions/workflows/CI.yml?query=branch%3Amain) | ||
| [](https://codecov.io/gh/ArrogantGao/OptimalBranchingCore.jl) | ||
| Core functions and types for the optimal branching method. One can use it separately or as part of the `OptimalBranching` package. | ||
|
|
||
| ## Usage | ||
|
|
||
| `OptimalBranchingCore` provides the basis tools for developing a branching algorithm, by dividing the branching process into the following steps: | ||
| * Reduction of the problem | ||
| * Generation of the branches | ||
| * Applying the branching rules on the problem | ||
|
|
||
| For the optimal branching method, the generation of the branches is further divided into the following sub-steps: | ||
| * Solving the branching table | ||
| * Pruning the branches | ||
| * Selecting the optimal branching rule via the set covering solver | ||
|
|
||
| For more details, please refer to the [docs](). |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,6 +1,16 @@ | ||
| # OptimalBranchingMIS | ||
|
|
||
| [](https://ArrogantGao.github.io/OptimalBranchingMIS.jl/stable/) | ||
| [](https://ArrogantGao.github.io/OptimalBranchingMIS.jl/dev/) | ||
| [](https://github.com/ArrogantGao/OptimalBranchingMIS.jl/actions/workflows/CI.yml?query=branch%3Amain) | ||
| [](https://codecov.io/gh/ArrogantGao/OptimalBranchingMIS.jl) | ||
| `OptimalBranchingMIS` is a developed based on `OptimalBranchingCore` for the optimal branching method on the maximum independent set (MIS) problem. | ||
|
|
||
| ## Usage | ||
|
|
||
| In this pacakge a set of tools for MIS problem has been provided, including: | ||
| * `MISProblem`: the problem type for MIS | ||
| * `MISReducer`: the reducer for MIS | ||
| * `MISSize` & `MISCount`: different types for the results, returning the size of the maximum independent set or together with the count of branches | ||
| * `MinBoundarySelector`: the selectors for the minimum boundary size | ||
| * `NumofVertex` & `D3Measure`: different measures for the MIS problem | ||
|
|
||
| Additionally, we provide `counting_mis1` and `counting_mis2` functions for counting the maximum independent sets, which are based on the `EliminateGraphs` package. | ||
|
|
||
| For more details, please refer to the [docs](). |