当前位置: X-MOL 学术Algorithmica › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Enumerating k-Arc-Connected Orientations
Algorithmica ( IF 0.9 ) Pub Date : 2020-08-03 , DOI: 10.1007/s00453-020-00738-y
Sarah Blind , Kolja Knauer , Petru Valicov

We study the problem of enumerating the k-arc-connected orientations of a graph G, i.e., generating each exactly once. A first algorithm using submodular flow optimization is easy to state, but intricate to implement. In a second approach we present a simple algorithm with O(knm2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(knm^2)$$\end{document} time delay and amortized time O(m2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(m^2)$$\end{document}, which improves over the analysis of the submodular flow algorithm. As ingredients, we obtain enumeration algorithms for the α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document}-orientations of a graph G in O(m2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(m^2)$$\end{document} time delay and for the outdegree sequences attained by k-arc-connected orientations of G in O(knm2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(knm^2)$$\end{document} time delay.

中文翻译:

枚举 k-Arc-Connected 方向

我们研究了枚举图 G 的 k 弧连通方向的问题,即,每个只生成一次。使用子模块流优化的第一种算法易于表述,但实施起来却很复杂。在第二种方法中,我们提出了一个简单的算法,其 O(knm2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{ mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$O(knm^2)$$\end{document} 时间延迟和摊销时间 O(m2)\documentclass[12pt ]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \开始{文档}$$O(m^2)$$\end{文档},这改进了对子模块流算法的分析。作为配料,
更新日期:2020-08-03
down
wechat
bug