20.500.12556/RUP-7800
On the complexity of the vector connectivity problem
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
true
true
false
Angleški jezik
Neznan jezik
Delo ni kategorizirano
2016-06-09 03:13:03
2017-04-03 08:05:09
2024-03-01 13:33:36
0000-00-00 00:00:00
2015
0
0
str. 60-71
Vol. 591
2015
0000-00-00
NiDoloceno
NiDoloceno
NiDoloceno
0000-00-00
0000-00-00
0000-00-00
0304-3975
519.17
26525952
10.1016/ j.tcs.2015.04.032
1537677764
http://dx.doi.org/10.1016/ j.tcs.2015.04.032
1
https://repozitorij.upr.si/Dokument.php?lang=slv&id=7799
Inštitut Andrej Marušič
0
0
0