نتائج البحث

Reachability relations, transitive digraphs and groups ; Dosegljivostne relacije, tranzitivni digrafi in grupe

• Authors : Malnič, Aleksander; Potočnik, Primož; Seifter, Norbert

Subjects: Cayley digraph; reachability relation; Cayleyjev digraf

• Source: Ars mathematica contemporanea, vol. 8, no. 1, pp. 83-94, 2015. ; ISSN: 1855-3966

تفاصيل العنوان

Reconstructing perfect phylogenies via branchings in acyclic digraphs ; Rekonstrukcija popolnih filogenij prek vejitev v acikličnih digrafih primeri

• Authors : Baghirova, Narmina; Milanič, Martin

Subjects: perfect phylogeny; minimum conflict-free row split problem; minimum uncovering branching problem

• Source: Koper

تفاصيل العنوان

Reachability relations in digraphs

• Authors : Malnič, Aleksander; Marušič, Dragan; Seifter, Norbert

Subjects: graph theory; digraph; reachability relations

تفاصيل العنوان

On the non-existence of families of (d,k,delta)-digraphs containing only selfrepeat vertices ; O dvodelnih razdaljno-regularnih grafih z natanko dvema nerazcepnima T-moduloma s krajiščem dva

• Authors : Filipovski, Slobodan; Jajcay, Robert

Subjects: Moore digraph; selfrepeat vertex; eigenvalue

• Source: Linear Algebra and its Applications, no. 563, pp. 302-312, 2019. ; ISSN: 0024-3795

تفاصيل العنوان

Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem

• Authors : Hujdurović, Ademir; Milanič, Martin; Husić, Edin

Subjects: perfect phylogeny; NP-hard problem; branching

• Source: 7th PhD Summer School in Discrete Mathematics, 2018.

تفاصيل العنوان

Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem

• Authors : Hujdurović, Ademir; Milanič, Martin; Husić, Edin

Subjects: perfect phylogeny; NP-hard problem; branching

• Source: Workshop on Discrete and Computational Biomathematics and Mathematical Chemistry 2017, 15-17 November 2017, UP FAMNIT, Koper, Slovenia, 2017.

تفاصيل العنوان

Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem

• Authors : Milanič, Martin

Subjects: perfect phylogeny; NP-hard problem; graph coloring

• Source: IX Latin and American Algorithms, Graphs and Optimization Symposium, September 11-15, 2017, Marseille, France, 2018.

تفاصيل العنوان

MIPUP

• Authors : Husić, Edin; Li, Xinyue; Hujdurović, Ademir

Subjects: perfect phylogeny; minimum conflict-free row split problem; branching

• Source: Bioinformatics, pp. 1-8, 2018. ; ISSN: 1367-4803

تفاصيل العنوان

Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem

• Authors : Hujdurović, Ademir; Husić, Edin; Milanič, Martin

Subjects: perfect phylogeny; minimum conflict-free row split problem; branching

• Source: ACM transactions on algorithms, vol. 14, no. 2, 2018. ; ISSN: 1549-6325

تفاصيل العنوان

Automorphism groups of circulant digraphs with applications to semigroup theory

• Authors : Araújo, Joao; Bentz, Wolfram; Dobson, Edward

Subjects: automorphism group; circulant digraph; semigroup

• Source: Combinatorica, vol. 38, no. 1, pp. 1-28, 2018. ; ISSN: 0209-9683

تفاصيل العنوان