Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
shortest cycle
Description:
A cycle of minimum length in a graph, studied in graph theory and algorithms for networks.
Primary topic:
Complexity and Algorithms in Graphs (48%)
Related topics:
Complexity and Algorithms in Graphs (48%),
Advanced Graph Theory Research (12%)
OpenAlex ID:
keywords/shortest-cycle
Tight Hardness for Shortest Cycles and Paths in Sparse Graphs
2018
·
Andrea Lincoln
, Virginia Vassilevska Williams
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
172
PDF
Graph Distances in the Data-Stream Model
2008
·
Joan Feigenbaum
, Sampath Kannan
, et al.
·
SIAM Journal on Computing
·
146
Graph Problems on a Mesh-Connected Processor Array
1984
·
Mikhail J. Atallah
, S. Rao Kosaraju
·
Journal of the ACM
·
104
PDF
Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs
2022
·
Garrett, Henry
·
Zenodo (CERN European Organization for Nuclear Research)
·
67
Solving the Two-Connected Network with Bounded Meshes Problem
2000
·
Bernard Fortz
, Martine Labbé
, et al.
·
Operations Research
·
56
PDF
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
2011
·
Jakub Łącki
, Piotr Sankowski
·
Lecture notes in computer science
·
50
Cycle graph analysis for 3D roof structure modelling: Concepts and performance
2014
·
Gamage Sanka Nirodha Perera
, Hans-Gerd Maas
·
ISPRS Journal of Photogrammetry and Remote Sensing
·
44
Parallel Algorithms for Graph Theoretic Problems
1977
·
Carla D. Savage
·
Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
·
40
The 2-linkage problem for acyclic digraphs
1985
·
Carsten Thomassen
·
Discrete Mathematics
·
37
PDF
Efficient approximation algorithms for shortest cycles in undirected graphs
2009
·
Andrzej Lingas
, Eva-Marta Lundell
·
Information Processing Letters
·
36
On enhancing hypercube multiprocessors
1988
·
Abdol H. Esfahanian
, Lionel M. Ni
, et al.
·
Rare & Special e-Zone (The Hong Kong University of Science and Technology)
·
33
Computing the Shortest Essential Cycle
2010
·
Jeff Erickson
, Pratik Worah
·
Discrete & Computational Geometry
·
31
PDF
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings
2012
·
Marek Cygan
, Harold N. Gabow
, et al.
·
Annual Symposium on Foundations of Computer Science
·
28
PDF
Short path queries in planar graphs in constant time
2003
·
Lukasz Kowalik
, Maciej Kurowski
·
ACM Symposium on Theory of Computing (STOC)
·
26
Tolerance Based Algorithms for the ATSP
2004
·
Boris Goldengorin
, Gerard Sierksma
, et al.
·
Lecture notes in computer science
·
23
Minimum Cut of Directed Planar Graphs in O ( n log log n ) Time
2018
·
Shay Mozes
, Kirill Nikolaev
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
21
The number of shortest cycles and the chromatic uniqueness of a graph
1992
·
C. P. Teo
, K. M. Koh
·
Journal of Graph Theory
·
21
On connected signed graphs with rank equal to girth
2022
·
Qi Wu
, Yong Lu
, et al.
·
Linear Algebra and its Applications
·
20
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
2008
·
Omid Amini
, Ignasi Sau
, et al.
·
Springer eBooks
·
20
Note on a min‐max conjecture of Woodall
2001
·
Orlando Lee
, Yoshiko Wakabayashi
·
Journal of Graph Theory
·
20
Lower Bounds for Subgraph Detection in the CONGEST Model
2018
·
Gonen, Tzlil
, Oshman, Rotem
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
19
PDF
Constant girth approximation for directed graphs in subquadratic time
2020
·
Shiri Chechik
, Yang P. Liu
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
18
PDF
Computing the Girth of a Planar Graph
2000
·
Hristo N. Djidjev
·
Lecture notes in computer science
·
17
Computing shortest cycles using universal covering space
2007
·
Xiaotian Yin
, Miao Jin
, et al.
·
The Visual Computer
·
16
Cycle Based Network Centrality
2018
·
Xiaoping Zhou
, Xun Liang
, et al.
·
Scientific Reports
·
15
PDF
Show more works
View as search
Works count:
134
Citation count:
1,421
Year
Topic
Type