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, recenzija, prikaz knjige, kritika Ključne besede: reconfiguration, dynamic programming, graph coloring Objavljeno v RUP: 26.10.2021; Ogledov: 1104; Prenosov: 8 Povezava na celotno besedilo |
2. |
3. |
4. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremMartin Milanič, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje) Ključne besede: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Objavljeno v RUP: 17.09.2018; Ogledov: 1882; Prenosov: 20 Povezava na celotno besedilo |
5. Adjacency preservers, symmetric matrices, and coresMarko Orel, 2012, izvirni znanstveni članek Opis: 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. Ključne besede: adjacency preserver, symmetric matrix, finite field, eigenvalue of a graph, coloring, quadratic form Objavljeno v RUP: 15.10.2013; Ogledov: 3139; Prenosov: 141 Povezava na celotno besedilo |