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.
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
Incorrect decomposition returned by Graph.treewidth #17893
Comments
Commit: |
New commits:
|
Branch: u/ncohen/17893 |
This comment has been minimized.
This comment has been minimized.
comment:3
3 failing doctests |
Reviewer: Frédéric Chapoton |
comment:5
Sorry about that. I just rebased the patch over the latest beta and added a commit to fix that. It is a rather good news, by the way: it means that the decompositions are smaller than previously. Nathann |
comment:6
ok, thanks. |
comment:7
Thaaaaaaaaanks for the review Nathann P.S. : Do you have any ticket I could review ? |
comment:8
Well, #17901 should be very easy.. |
comment:9
HMmmm... Well, I am already having a very hard time checking that Nathann |
Changed branch from u/ncohen/17893 to |
As reported on asksage [1], the function
Graph.treewidth
can return incorrect tree decompositions.The computations are actually done right (the width returned is correct), but my attempts to "simplify" the tree while it is being built simplified.. a bit too much.
The way it is done now is a bit more correct, though a tad more ressource-consuming. Nothing important, as the post-processing is infiinitely cheaper than the actual solving anyway.
Nathann
[1] http://ask.sagemath.org/question/26011/treewidth/
CC: @dcoudert @slel
Component: graph theory
Author: Nathann Cohen
Branch/Commit:
d3d967d
Reviewer: Frédéric Chapoton
Issue created by migration from https://trac.sagemath.org/ticket/17893
The text was updated successfully, but these errors were encountered: