Finding shorter cycles in a weighted graph

DOI10.1007/s00373-015-1576-8zbMath1409.05098OpenAlexW2042536069MaRDI QIDQ5964975

Han Ren, Fugang Chao, Ni Cao

Publication date: 2 March 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1576-8

zbMATH Keywords

fundamental cycle\(3\)-path-conditionDijkstra's algorithm

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Uses Software

• LDPC

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Embeddings of graphs with no short noncontractible cycles
• The complexity of determining a shortest cycle of even length
• Weakly bipartite graphs and the max-cut problem
• Five-coloring maps on surfaces
• Minimal cycle bases of outerplanar graphs
• Minimum cycle bases of graphs on surfaces
• Über ein Problem von K. Zarankiewicz
• An algorithm for counting short cycles in bipartite graphs
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Finding Even Cycles Even Faster

This page was built for publication: Finding shorter cycles in a weighted graph