Lupa

Show document Help

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:URL 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 This link opens in a new window
ISSN:0304-3975
UDC:519.17
DOI:10.1016/ j.tcs.2015.04.032 This link opens in a new window
COBISS.SI-ID:1537677764 This link opens in a new window
Publication date in RUP:03.04.2017
Views:2308
Downloads:59
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.

Secondary language

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


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