A shortest cycle for each vertex of a graph
type: Item
instance of: scholarly article
title: A shortest cycle for each vertex of a graph
zbMATH Open document ID: 1260.05083
author: Raphael Yuster
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 6150490
zbMATH Keywords: graph algorithms
zbMATH Keywords: girth
zbMATH Keywords: shortest path
zbMATH Keywords: undirected graph
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.07.019
OpenAlex ID: W2071406157
cites work: Color-coding
cites work: More algorithms for all-pairs shortest paths in weighted graphs
cites work: Matrix multiplication via arithmetic progressions
cites work: A note on two problems in connexion with graphs
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Finding a Minimum Circuit in a Graph
cites work: Q5365130
cites work: Minimum Weight Cycles and Triangles: Equivalences and Algorithms
cites work: Disjoint paths in a network
cites work: A quick method for finding shortest pairs of disjoint paths
cites work: Finding Even Cycles Even Faster
cites work: All pairs shortest paths using bridging sets and rectangular matrix multiplication
DOI: 10.1016/J.IPL.2011.07.019
description: scientific article; zbMATH DE number 6150490