On the complexity of the vector connectivity problem
Abstract
On the complexity of the vector connectivity problem
Keywords
vector connectivity;APX-hardness;NP-hardness;polynomial-time algorithm;block graphs;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2015 |
| Typology: | 1.01 - Original Scientific Article |
| Organization: | UP - University of Primorska |
| UDC: | 519.17 |
| COBISS: |
1537677764
|
| ISSN: | 0304-3975 |
| Views: | 2244 |
| Downloads: | 59 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | Unknown |
|---|---|
| Secondary keywords: | vektorska povezanost;APX-težek problem;NP-težek problem;polinomski algoritem;bločni graf; |
| Type (COBISS): | Not categorized |
| Pages: | str. 60-71 |
| Volume: | ǂVol. ǂ591 |
| Issue: | Vol. 591 |
| Chronology: | 2015 |
| DOI: | 10.1016/ j.tcs.2015.04.032 |
| ID: | 9142661 |
Recommended works:
On the complexity of the vector connectivity problem
2015,
no subtitle data available
Vector connectivity in graphs
2014,
no subtitle data available
Vector connectivity in graphs
2014,
no subtitle data available
Mind the independence gap
2020,
no subtitle data available
Improved algorithms for k-domination and total k-domination in proper interval graphs
2018,
no subtitle data available