Finding shortest non-trivial cycles in directed graphs on surfaces

DOI10.20382/JOCG.V7I1A7zbMATH Open1405.05033OpenAlexW2394608588MaRDI QIDQ2970447FDOQ2970447

Authors: S. Cabello, Éric Colin de Verdière, Francis Lazarus 

Publication date: 30 March 2017

Full work available at URL: https://doaj.org/article/5aed78efa2314631b1e2fa2ae7202dff

Recommendations

• Finding shortest non-trivial cycles in directed graphs on surfaces
• Shortest non-trivial cycles in directed surface graphs
• Shortest non-trivial cycles in directed and undirected surface graphs
• scientific article; zbMATH DE number 6783459
• Algorithms – ESA 2005

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22) Paths and cycles (05C38)

Cited In (10)

• Topologically trivial closed walks in directed surface graphs
• Holiest minimum-cost paths and flows in surface graphs
• Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
• Approximation algorithms for Euler genus and related problems
• Title not available (Why is that?)
• Finding shortest non-trivial cycles in directed graphs on surfaces
• Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
• Shortest non-trivial cycles in directed surface graphs
• Shortest non-trivial cycles in directed and undirected surface graphs
• Embeddability of arrangements of pseudocircles and graphs on surfaces

This page was built for publication: Finding shortest non-trivial cycles in directed graphs on surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970447)