Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem, National Research University Higher School of Economics, Faculty of Computer Science, Moscow, 21. 8. 19

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem, National Research University Higher School of Economics, Faculty of Computer Science, Moscow, 21. 8. 19
Authors:	ID Milanič, Martin (Author)
Files:	https://cs.hse.ru/en/big-data/tcs-lab/seminar
Language:	English
Work type:	Unknown
Typology:	3.14 - Invited Lecture at Foreign University
Organization:	FAMNIT - Faculty of Mathematics, Science and Information Technologies
Keywords:	simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph
Year of publishing:	2019
PID:	20.500.12556/RUP-11907
UDC:	51
COBISS.SI-ID:	1541487556
Publication date in RUP:	03.09.2019
Views:	2385
Downloads:	18
Metadata:
:	MILANIČ, Martin, 2019, Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem, National Research University Higher School of Economics, Faculty of Computer Science, Moscow, 21. 8. 19. [online]. 2019. [Accessed 5 April 2025]. Retrieved from: https://cs.hse.ru/en/big-data/tcs-lab/seminar Copy citation