Print
Lupa

Show document Help

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:URL 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 This link opens in a new window
UDC:51
COBISS.SI-ID:1541487556 This link opens in a new window
Publication date in RUP:03.09.2019
Views:1645
Downloads:16
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for 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 must 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