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:	03.04.2017
Views:	3142
Downloads:	62
Metadata:
:	CICALESE, Ferdinando, MILANIČ, Martin and RIZZI, Romeo, 2015, On the complexity of the vector connectivity problem. [online]. 2015. Vol. 591, p. 60–71. [Accessed 5 April 2025]. DOI 10.1016/ j.tcs.2015.04.032. Retrieved from: http://dx.doi.org/10.1016/ j.tcs.2015.04.032 Copy citation