Complexity and algorithms for constant diameter augmentation problems

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Complexity and algorithms for constant diameter augmentation problems
Authors:	ID Kim, Eun Jung (Author) ID Milanič, Martin (Author) ID Monnot, Jérôme (Author) ID Picouleau, Christophe (Author)
Files:	https://www.sciencedirect.com/science/article/abs/pii/S0304397521003042?via%3Dihub https://www.sciencedirect.com/science/article/abs/pii/S0304397521003042?via%3Dihub
Language:	English
Work type:	Unknown
Typology:	1.01 - Original Scientific Article
Organization:	IAM - Andrej Marušič Institute
Keywords:	graph diameter, blocker problem, polynomial algorithm, NP-complete problem
Year of publishing:	2021
Number of pages:	str. 1-18
PID:	20.500.12556/RUP-16313
UDC:	519.17
ISSN on article:	0304-3975
DOI:	10.1016/j.tcs.2021.05.020
COBISS.SI-ID:	65290243
Publication date in RUP:	04.06.2021
Views:	1235
Downloads:	59
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.

Title:	Theoretical computer science
Shortened title:	Theor. comp. sci.
Publisher:	Elsevier
ISSN:	0304-3975
COBISS.SI-ID:	26525952

Language:	English
Keywords:	premer grafa, problem blokiranja, polinomski algoritem, NP-poln problem

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back