The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs-Reference-Cited by-同舟云学术

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

The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs

Published:1994-05 Issue:3 Volume:7 Page:403-418
ISSN:0895-4801
Container-title:SIAM Journal on Discrete Mathematics
language:en
Short-container-title:SIAM J. Discrete Math.

Author:

Hartvigsen David,Mardon Russell

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics

Link

http://epubs.siam.org/doi/pdf/10.1137/S0895480190177042

Reference28 articles.

1. Cycle bases of minimal measure for the structural analysis of skeletal structures by the flexibility method

2. A linear algorithm for embedding planar graphs using PQ-trees

3. On optimally sparse cycle and coboundary basis for a linear graph

4. Graph theory and molecular orbitals. VII. The role of resonance structures

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

1. Sparse Pose Graph Optimization in Cycle Space;IEEE Transactions on Robotics;2021-10

2. Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time;SIAM Journal on Computing;2021-01

3. Holiest minimum-cost paths and flows in surface graphs;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20

4. Efficient Algorithms for Computing a Minimal Homology Basis;LATIN 2018: Theoretical Informatics;2018

5. Approximating the Diameter of Planar Graphs in Near Linear Time;ACM Transactions on Algorithms;2016-02-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP