Skip to content

Chordal coloring algorithm. #202

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
gdalle merged 13 commits into from
Mar 9, 2025
Merged

Chordal coloring algorithm. #202

Changes from 1 commit
Commits
Show all changes
13 commits
Select commit Hold shift + click to select a range
f937166
Add chordal coloring.
samuelsonric Mar 8, 2025
003360b
fix bug
samuelsonric Mar 8, 2025
ef9f444
Add ordering algorithm: `PerfectEliminationOrder`
samuelsonric Mar 8, 2025
0279098
Add tests for ordering algorithm `PerfectEliminationOrder`.
samuelsonric Mar 8, 2025
7d5e1a5
Respond to PR comments.
samuelsonric Mar 8, 2025
8798bc6
Add `PerfectEliminationOrder` to api.
samuelsonric Mar 8, 2025
52b0a70
Update src/order.jl
gdalle Mar 9, 2025
d9faa7a
Update src/order.jl
gdalle Mar 9, 2025
99a02d0
Update src/order.jl
gdalle Mar 9, 2025
1642fc8
Fix docstring
gdalle Mar 9, 2025
226d8d8
Bump version
gdalle Mar 9, 2025
13300d2
Make elimination algorithm parametric
gdalle Mar 9, 2025
38ba304
Only substitution
gdalle Mar 9, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 4 additions & 1 deletion src/order.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -305,7 +305,10 @@ const DynamicLargestFirst = DynamicDegreeBasedOrder{:forward,:low2high}
"""
PerfectEliminationOrder

A linear-time ordering code for symmetric graphs. On [chordal graphs](https://en.wikipedia.org/wiki/Chordal_graph), the code computes a perfect elimination ordering. Otherwise, it computes a suboptimal ordering.
Instance of [`AbstractOrder`](@ref) which computes a perfect elimination ordering when the underlying graph is [chordal](https://en.wikipedia.org/wiki/Chordal_graph). For generic graphs, it computes a suboptimal ordering.

!!! warning
This order can only be applied for symmetric or bidirectional coloring problems, not unidirectional ones.
Comment thread
gdalle marked this conversation as resolved.
Outdated

!!! danger
This order is implemented as a package extension and requires loading [CliqueTrees.jl](https://github.com/AlgebraicJulia/CliqueTrees.jl).
Expand Down