Login
Lupa
First page / Search the repository

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 10 / 18
First pagePrevious page12Next pageLast page
1.
Treewidth versus clique number. I. graph classes with a forbidden structure
Clément Jean Dallard, Martin Milanič, Kenny Štorgel, 2021, original scientific article

Keywords: graph class, treewidth, clique number
Published in RUP: 09.11.2021; Views: 908; Downloads: 24
URL Link to full text

2.
Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing units
Christian Trefftz, Andrés Santamaría-Galvis, Roberto Cruz Rodes, 2014, published scientific conference contribution

Keywords: graph theory, graphics processing units, parallel algorithms, CUDA, Thrust library, interval graphs, maximal clique
Published in RUP: 18.10.2021; Views: 1015; Downloads: 23
URL Link to full text

3.
Strong cliques and stable sets
Martin Milanič, 2021, independent scientific component part or a chapter in a monograph

Keywords: strong clique, strong stable set, CIS graph, general partition graph, localizable graph
Published in RUP: 16.07.2021; Views: 1027; Downloads: 33
URL Link to full text

4.
Recent results and open problems on CIS Graphs
Martin Milanič, 2020, published scientific conference contribution abstract (invited lecture)

Keywords: strong clique, strong stable set, CIS graph
Published in RUP: 17.12.2020; Views: 1009; Downloads: 61
.pdf Full text (3,20 MB)
This document has more files! More...

5.
Strong cliques in diamond-free graphs
Nina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, original scientific article

Keywords: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, strongly perfect graph, CIS graph, NP-hard problem, polynomial-time algorithm, Erdős-Hajnal property
Published in RUP: 17.12.2020; Views: 1260; Downloads: 39
URL Link to full text

6.
Treewidth versus clique number in graph classes with a forbidden structure
Clément Jean Dallard, Martin Milanič, Kenny Štorgel, 2020, published scientific conference contribution

Keywords: graph class, treewidth, clique number
Published in RUP: 10.11.2020; Views: 1333; Downloads: 34
URL Link to full text

7.
Strong cliques in diamond-free graphs
Nina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, published scientific conference contribution

Keywords: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, CIS graph, NP-hard problem, linear-time algorithm, Erdős-Hajnal property
Published in RUP: 10.11.2020; Views: 1363; Downloads: 36
URL Link to full text

8.
Strong cliques in vertex-transitive graphs
Ademir Hujdurović, 2020, original scientific article

Keywords: CIS graph, localizable graph, strong clique
Published in RUP: 06.05.2020; Views: 1414; Downloads: 67
URL Link to full text

9.
Qiao, Zhi, Koolen, Jack: A new characterization of the dual polar graphs. (English summary). - J. Combin. Theory Ser. B 135 (2019), 200-211
Safet Penjić, 2020, review, book review, critique

Keywords: Distance-regular graph, dual polar graph, Delsarte clique
Published in RUP: 15.04.2020; Views: 1443; Downloads: 13
URL Link to full text

10.
A characterization of Claw-free CIS graphs and new results on the order of CIS graphs
Liliana Alcón, Marisa Gutierreza, Martin Milanič, 2019, original scientific article

Keywords: CIS graph, maximal clique, maximal stable set, maximal independent set, randomly internally matchable graph, claw-free graph
Published in RUP: 16.10.2019; Views: 1690; Downloads: 60
URL Link to full text
Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica