Skip to content
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

Jump to bottom

Try detecting forced assignments #5

Open
TimonKnigge opened this issue Jun 12, 2018 · 2 comments
Open

Try detecting forced assignments #5

TimonKnigge opened this issue Jun 12, 2018 · 2 comments

Comments

@TimonKnigge
Copy link
Owner

No description provided.

@TimonKnigge
Copy link
Owner Author

If v is free but reachable from A, and S is the set of trees that are adjacent to an edge incident to v, then we can compute a new bound as f + |S| + new packing bound on trees\S.

@TimonKnigge
Copy link
Owner Author

If we have assigned R edge to red already, and a partially red vertex contains more than MAX-R adjacent free edges, it needs to be cut.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@TimonKnigge