Algorithms for finding a rooted \((k,1)\)-edge-connected orientation
type: Item
instance of: scholarly article
title: Algorithms for finding a rooted \((k,1)\)-edge-connected orientation
zbMATH Open document ID: 1283.05150
author: Csaba Király
published in: Discrete Applied Mathematics
publication date: 2014-02-18T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 6258980
zbMATH Keywords: orientation
zbMATH Keywords: rooted edge-connectivity
zbMATH Keywords: highly \(k\)-tree-connected
MaRDI profile type: Publication
full work available at URL: j.dam.2013.10.004
OpenAlex ID: W2035354248
cites work: Minimum partition of a matroid into independent subsets
cites work: Q5514188
cites work: Q4744300
cites work: On the orientation of graphs
cites work: Q3085455
cites work: On the orientation of graphs and hypergraphs
cites work: Generalized polymatroids and submodular flows
cites work: Packing algorithms for arborescences (and spanning trees) in capacitated graphs
cites work: On the degrees of the vertices of a directed graph
cites work: A note on the Frank-Tardos bi-truncation algorithm for crossing- submodular functions
cites work: On the Problem of Decomposing a Graph into n Connected Factors
DOI: 10.1016/J.DAM.2013.10.004
description: scientific article