Lupa

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:Milanič, Martin (Author)
Files:URL https://cs.hse.ru/en/big-data/tcs-lab/seminar
 
Language:English
Work type:Unknown
Tipology: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
UDC:51
COBISS_ID:1541487556 Link is opened in a new window
Views:163
Downloads:1
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:Document is not linked to any category.
:
  
Average score:(0 votes)
Your score:Voting is allowed only to logged in users.
Share:Bookmark and Share

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Keywords:simplicialna točka, izogibna točka, problem najtežje klike, polinomski algoritem, ciklično usmerljiv graf

Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica