On the complexity of the vector connectivity problem
2015
2016-06-09 03:13:03
1033
vector connectivity, APX-hardness, NP-hardness, polynomial-time algorithm, block graphs,
vektorska povezanost, APX-težek problem, NP-težek problem, polinomski algoritem, bločni graf,
r6
Ferdinando
Cicalese
70
Martin
Milanič
70
Romeo
Rizzi
70
ISSN
2
0304-3975
UDK
4
519.17
OceCobissID
13
26525952
DOI
15
10.1016/ j.tcs.2015.04.032
COBISS.SI-ID
3
1537677764
0
Predstavitvena datoteka
2016-06-09 03:13:03