Vector connectivity in graphs

DOI10.1002/net.21545zbMath1386.05096OpenAlexW2133304595WikidataQ59560505 ScholiaQ59560505MaRDI QIDQ4642479

Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanič

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://www.cobiss.si/scripts/cobiss?command=DISPLAY&base=cobib&rid=1537132484&fmt=11

zbMATH Keywords

approximation algorithmsplit graphpolynomial time algorithmcographvector connectivity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (1)

On the complexity of the vector connectivity problem

This page was built for publication: Vector connectivity in graphs