Print
Login
Lupa
First page / Show document

Show document Help

A- | A+ | Print
Title:A polynomial-time algorithm for the independent set problem in {P_{10}, C_4, C_6}-free graphs
Authors:ID Husić, Edin (Author)
ID Milanič, Martin (Author)
Files:URL https://link.springer.com/chapter/10.1007%2F978-3-030-30786-8_21
 
Language:English
Work type:Unknown
Typology:1.08 - Published Scientific Conference Contribution
Organization:IAM - Andrej Marušič Institute
Keywords:independent set, augmenting graph, polynomial-time algorithm
Year of publishing:2019
Number of pages:Str. 271-284
PID:20.500.12556/RUP-11980 This link opens in a new window
UDC:519.17:004
ISSN on article:0302-9743
DOI:10.1007/978-3-030-30786-8_21 This link opens in a new window
COBISS.SI-ID:1541565380 This link opens in a new window
Publication date in RUP:16.10.2019
Views:1589
Downloads:115
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.

Record is a part of a proceedings

Title:Graph-theoretic concepts in computer science
COBISS.SI-ID:1541564612 This link opens in a new window

Record is a part of a journal

Title:Lecture notes in computer science
Shortened title:Lect. notes comput. sci.
Publisher:Springer
ISSN:0302-9743
COBISS.SI-ID:4292374 This link opens in a new window

Secondary language

Language:English
Keywords:neodvisna množica, povečujoč graf, polinomski algoritem


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