Graph orientations with set connectivity requirements
type: Item
instance of: scholarly article
title: Graph orientations with set connectivity requirements
zbMATH Open document ID: 1245.05074
author: Takuro Fukunaga
published in: Discrete Mathematics
publication date: 2012-08-10T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 6064642
zbMATH Keywords: edge-connectivity
zbMATH Keywords: graph orientation
zbMATH Keywords: group Steiner tree packing
MaRDI profile type: Publication
full work available at URL: j.disc.2012.04.004
OpenAlex ID: W1978956606
cites work: An algorithm for source location in directed graphs
cites work: Q4386300
cites work: Q3085455
cites work: The Set Connector Problem in Graphs
cites work: Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
cites work: Augmenting edge-connectivity between vertex subsets
cites work: On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
cites work: Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
cites work: On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
DOI: 10.1016/J.DISC.2012.04.004
description: scientific article; zbMATH DE number 6064642