#12716: MILP formulation and test functions for vertex separation
--------------------------------------------------------------------+-------
Reporter: dcoudert |
Owner: jason, ncohen, rlm
Type: enhancement |
Status: needs_review
Priority: major |
Milestone: sage-5.0
Component: graph theory |
Resolution:
Keywords: graph, decomposition, linear ordering, pathwidth | Work
issues:
Report Upstream: N/A |
Reviewers: Nathann Cohen
Authors: David Coudert |
Merged in:
Dependencies: |
Stopgaps:
--------------------------------------------------------------------+-------
Description changed by dcoudert:
Old description:
> This patch gathers (di)graph decompositions functions (path
> decompositions, vertex separation, etc.) when the decomposition is
> represented as linear ordering of the vertices. It also provides some
> measurement functions of linear orderings according to particular widths.
>
> I propose to gather these functions inside an object of class
> `LinearOrdering` to ease access and prevent increasing the number of
> methods of (Di)Graphs objects.
> I'm ready to discuss / modify this patch.
>
> I will later add other measurement functions (tree
> decomposition/treewidth, cutwidth,....) and some methods for computing
> optimal orderings according these width.
New description:
This patch implements a MILP formulation for the vertex separation and
some test functions for evaluating the width of linear vertex orderings.
APPLY:
* [attachment:trac_12716_MILP.patch]
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12716#comment:2>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
