Two algorithms for general list matrix partitions
From MaRDI portal
Recommendations
- The list partition problem for graphs
- A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 2 submatrices
- A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices
- An algorithm for nontransitive partitions
- scientific article; zbMATH DE number 2233533
- Counting List Matrix Partitions of Graphs
- A randomized algorithm for two-cluster partition of a set of vectors
- The Complexity of the List Partition Problem for Graphs
- The vectorization of the partition problem
- scientific article; zbMATH DE number 1559404
Cited in
(17)- An upper bound on adaptable choosability of graphs
- List matrix partitions of graphs representing geometric configurations
- Dichotomy for tree-structured trigraph list homomorphism problems
- On the adaptable chromatic number of graphs
- Matrix partitions of perfect graphs
- Graph partitions with prescribed patterns
- A polynomial algorithm for 3-compatible coloring and the stubborn list partition problem (the stubborn problem is stubborn no more)
- Matrix Partitions with Finitely Many Obstructions
- The Complexity of the List Partition Problem for Graphs
- Adapted list coloring of planar graphs
- Colouring, constraint satisfaction, and complexity
- Computing \(H\)-joins with application to 2-modular decomposition
- scientific article; zbMATH DE number 7561704 (Why is no real title available?)
- The stubborn problem is stubborn no more: a polynomial algorithm for 3-compatible colouring and the stubborn List partition problem
- Rainbow graph splitting
- The complexity of list edge-partitions for simple graphs
- List matrix partitions of chordal graphs
This page was built for publication: Two algorithms for general list matrix partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921752)
