The complexity of mixed-connectivity

Édouard Bonnet () and Sergio Cabello ()
Additional contact information
Édouard Bonnet: Université Claude Bernard Lyon 1
Sergio Cabello: University of Ljubljana

Annals of Operations Research, 2021, vol. 307, issue 1, No 2, 25-35

Abstract: Abstract We investigate the parameterized complexity in a and b of determining whether a graph G has a subset of a vertices and b edges whose removal disconnects G, or disconnects two prescribed vertices $$s, t \in V(G)$$ s , t ∈ V ( G ) .

Keywords: Mixed-connectivity; Mixed-cut; Vertex-connectivity; Edge-connectivity; NP-completeness; Parameterized complexity (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-021-04330-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:307:y:2021:i:1:d:10.1007_s10479-021-04330-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-021-04330-7

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().