SLO

Login

First page / Search the repository

Search the repository

A- | A+ | Print

Query:	search in
	search in
	search in
	search in
Work type:	* old and bologna study programme
Language:
Search in:
Options:	Show only hits with full text
	Reset

1 - 4 / 4

1

1.

Edge elimination and weighted graph classes
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaž Krnc, Martin Milanič, Nevena Pivač, Robert Scheffler, Martin Strehler, 2020, published scientific conference contribution

Keywords: edge elimination, weighted graph, split graph, threshold graph, chain graph, linear-time recognition algorithm
Published in RUP: 10.11.2020; Views: 2229; Downloads: 36
Link to full text

2.

Bipartite graphs of small readability
Rayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nithin Varma, 2019, original scientific article

Keywords: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph
Published in RUP: 26.07.2019; Views: 2458; Downloads: 102
Link to full text

3.

Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Martin 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: 2664; Downloads: 22
Link to full text

4.

Bipartite graphs of small readability
Rayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nidhi Varma Srivastava, 2018, published scientific conference contribution

Keywords: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph
Published in RUP: 17.09.2018; Views: 3082; Downloads: 71
Link to full text

Search done in 0 sec.

Logos of partners