Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs

Published:2012 Issue: Volume: Page:49-60
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bezáková Ivona,Langley Zachary

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-32241-9_5.pdf

Reference15 articles.

1. Ball, M.O., Provan, J.S.: Calculating bounds on reachability and connectnedness in stochastic networks. Networks 13, 253–278 (1983)

2. Bezáková, I., Friedlander, A.J.: Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time. Theor. Comp. Sci. 417, 2–11 (2012)

3. Borradaile, G., Klein, P.N.: An O(nlogn) algorithm for maximum st-flow in a directed planar graph. J. ACM 56(2) (2009)

4. Borradaile, G., Klein, P.N., Mozes, S., Nussbaum, Y., Wulff-Nilsen, C.: Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time. In: Proceedings of the 52nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 170–179 (2011)

5. Borradaile, G., Sankowski, P., Wulff-Nilsen, C.: Min st-cut oracle for planar graphs with near-linear preprocessing time. In: Proceedings of the 51st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 601–610 (2010)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Minimum Planar Multi-sink Cuts with Connectivity Priors;Mathematical Foundations of Computer Science 2014;2014

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3