On the negative cost girth problem in planar networks-Reference-Cited by-同舟云学术

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

On the negative cost girth problem in planar networks

Published:2015-11 Issue: Volume:35 Page:40-50
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Williamson Matthew,Subramani K.

Funder

NASA

National Science Foundation

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference32 articles.

1. Color-coding;Alon;J. ACM,1995

2. Finding and counting given length cycles;Alon;Algorithmica,1997

3. A deterministic near-linear time algorithm for finding minimum cuts in planar graphs;Chalermsook,2004

4. Computing the girth of a planar graph in linear time;Chang,2011

5. Introduction to Algorithms;Cormen,2009

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

1. Empirical analysis of algorithms for the shortest negative cost cycle problem;Discrete Applied Mathematics;2019-01

2. Randomized algorithms for finding the shortest negative cost cycle in networks;Discrete Applied Mathematics;2018-02

3. Corrigendum to “On the negative cost girth problem in planar networks” [Journal of Discrete Algorithms 35 (2015) 40–50];Journal of Discrete Algorithms;2016-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP