| 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: | 3076 |
|---|
| Downloads: | 18 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
