add method to compute the length of a tree-decomposition #36705
Merged
Conversation
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
vbraun
force-pushed
the
develop
branch
4 times, most recently
from
23f6715
to
e349b00
Compare
dcoudert
force-pushed
the
graphs/length_of_tree_decomposition
branch
from
2334b6e
to
08939a8
Compare
kwankyu
reviewed
Nov 23, 2023
kwankyu
reviewed
Nov 23, 2023
|
The macro looks good in the documentation preview. |
|
Documentation preview for this PR (built with commit 7fcc517; changes) is ready! 🎉 |
|
Thank you. |
vbraun
pushed a commit
to vbraun/sage
that referenced
this pull request
Dec 7, 2023
…ition
Given a graph `G` and a tree-decomposition `T` of `G`, the _length_ of
the tree-decomposition `T` is the maximum _diameter_ in `G` of its bags,
where the diameter of a bag `X_i` is the largest distance in `G` between
the vertices in `X_i`.
We add a method to compute the _length_ of a given tree-decomposition of
a graph.
### 📝 Checklist
<!-- Put an `x` in all the boxes that apply. -->
<!-- If your change requires a documentation PR, please link it
appropriately -->
<!-- If you're unsure about any of these, don't hesitate to ask. We're
here to help! -->
<!-- Feel free to remove irrelevant items. -->
- [x] The title is concise, informative, and self-explanatory.
- [x] The description explains in detail what this PR is about.
- [ ] I have linked a relevant issue or discussion.
- [x] I have created tests covering the changes.
- [x] I have updated the documentation accordingly.
### ⌛ Dependencies
<!-- List all open PRs that this PR logically depends on
- sagemath#12345: short description why this is a dependency
- sagemath#34567: ...
-->
<!-- If you're unsure about any of these, don't hesitate to ask. We're
here to help! -->
URL: sagemath#36705
Reported by: David Coudert
Reviewer(s): David Coudert, Kwankyu Lee
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Given a graph
Gand a tree-decompositionTofG, the length of the tree-decompositionTis the maximum diameter inGof its bags, where the diameter of a bagX_iis the largest distance inGbetween the vertices inX_i.We add a method to compute the length of a given tree-decomposition of a graph.
📝 Checklist
⌛ Dependencies