Tree‐based Graph Partitioning Constraint

DOI10.1002/9781118604304zbMATH Open1370.05001OpenAlexW2476125097MaRDI QIDQ3171237FDOQ3171237

Authors: Xavier Lorca 

Publication date: 5 October 2011

Full work available at URL: https://doi.org/10.1002/9781118604304

Recommendations

• Global constraints for tree partitions of graphs
• Obstacles to partitioning a graph into trees
• Partitioning graphs of bounded tree-width
• Graph partitioning with acyclicity constraints
• On tree-partitions of graphs
• scientific article; zbMATH DE number 4029297
• scientific article; zbMATH DE number 672025
• Partitions of Graphs into Trees
• Propagation rules for graph partitioning constraints
• On the complexity of graph tree partition problems.

Mathematics Subject Classification ID

Trees (05C05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (4)

• Constrained domatic bipartition on trees
• Combining tree partitioning, precedence, and incomparability constraints
• Global constraints for tree partitions of graphs
• Multi-level spectral graph partitioning method

This page was built for publication: Tree‐based Graph Partitioning Constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171237)