On the complexity of the vector connectivity problem

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	On the complexity of the vector connectivity problem
Authors:	ID Cicalese, Ferdinando (Author) ID Milanič, Martin (Author) ID Rizzi, Romeo (Author)
Files:	http://dx.doi.org/10.1016/ j.tcs.2015.04.032
Language:	English
Work type:	Not categorized
Typology:	1.01 - Original Scientific Article
Organization:	IAM - Andrej Marušič Institute
Keywords:	vector connectivity, APX-hardness, NP-hardness, polynomial-time algorithm, block graphs
Year of publishing:	2015
Number of pages:	str. 60-71
Numbering:	Vol. 591
PID:	20.500.12556/RUP-7800
ISSN:	0304-3975
UDC:	519.17
DOI:	10.1016/ j.tcs.2015.04.032
COBISS.SI-ID:	1537677764
Publication date in RUP:	02.04.2017
Views:	2829
Downloads:	60
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.

Language:	Unknown
Keywords:	vektorska povezanost, APX-težek problem, NP-težek problem, polinomski algoritem, bločni graf

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back