A polynomial-time algorithm for the independent set problem in {P_{10}, C_4, C_6}-free graphs

SLO

First page / Show document

Show document

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:	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
UDC:	519.17:004
ISSN on article:	0302-9743
DOI:	10.1007/978-3-030-30786-8_21
COBISS.SI-ID:	1541565380
Publication date in RUP:	16.10.2019
Views:	2559
Downloads:	119
Metadata:
:	HUSIĆ, Edin and MILANIČ, Martin, 2019, A polynomial-time algorithm for the independent set problem in {P_{10}, C_4, C_6}-free graphs. In : Graph-theoretic concepts in computer science [online]. Published Scientific Conference Contribution. 2019. p. 271–284. [Accessed 5 April 2025]. Retrieved from: https://link.springer.com/chapter/10.1007%2F978-3-030-30786-8_21 Copy citation

Average score:	0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 (0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Similar works from our repository:

Similar works from other repositories:

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

Title:	Graph-theoretic concepts in computer science
COBISS.SI-ID:	1541564612

Title:	Lecture notes in computer science
Shortened title:	Lect. notes comput. sci.
Publisher:	Springer
ISSN:	0302-9743
COBISS.SI-ID:	4292374

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

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back