Tree‐based Graph Partitioning Constraint

DOI10.1002/9781118604304zbMATH Open1370.05001OpenAlexW2476125097MaRDI QIDQ3171237FDOQ3171237

Xavier Lorca

Publication date: 5 October 2011

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

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 (3)

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Partitioning graphs of bounded tree-width 👍 👎
• Obstacles to partitioning a graph into trees 👍 👎
• On tree-partitions of graphs 👍 👎
• Partitions of Graphs into Trees 👍 👎
• On the complexity of graph tree partition problems. 👍 👎
• Graph Partitioning with Acyclicity Constraints 👍 👎
• Propagation Rules for Graph Partitioning Constraints 👍 👎

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)