1. Bonsma, Paul; Paulusma, Daniël: Using contracted solution graphs for solving reconfiguration problems. (English summary) Acta Inform. 56 (2019), no. 7-8, 619-648.Clément Jean Dallard, 2021, review, book review, critique Keywords: reconfiguration, dynamic programming, graph coloring Published in RUP: 26.10.2021; Views: 1121; Downloads: 8 Link to full text |
2. |
3. |
4. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremMartin Milanič, 2018, published scientific conference contribution abstract (invited lecture) Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Published in RUP: 17.09.2018; Views: 1899; Downloads: 20 Link to full text |
5. |
6. Adjacency preservers, symmetric matrices, and coresMarko Orel, 2012, original scientific article Abstract: It is shown that the graph ▫$\Gamma_n$▫ that has the set of all ▫$n \times n$▫ symmetric matrices over a finite field as the vertex set, with two matrices being adjacent if and only if the rank of their difference equals one, is a core if ▫$n \ge 3$▫. Eigenvalues of the graph ▫$\Gamma_n$▫ are calculated as well. Keywords: adjacency preserver, symmetric matrix, finite field, eigenvalue of a graph, coloring, quadratic form Published in RUP: 15.10.2013; Views: 3154; Downloads: 141 Link to full text |