Circuit bases of strongly connected digraphs

DOI10.7151/DMGT.1200MaRDI QIDQ4823306zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Petra M. Gleiss, Josef Leydold, Peter F. Stadler

Publication date 27 October 2004

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/5fbd7cf6eb1bce126475490251e1437d3f9c54d5

zbMATH Keywords

cycle spacedirected graphsminimum length basisrelevant circuits

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Minimum Cycle Bases and Their Applications
• Algorithms to compute minimum cycle basis in directed graphs
• Minimum Cycle Bases in Graphs Algorithms and Applications
• scientific article; zbMATH DE number 2197947
• STACS 2005

Cited in

(16)

• Effective generation of subjectively random binary sequences
• Finding a homotopy base for directed paths in an acyclic graph
• An optimal algorithm for the period of a strongly connected digraph
• Node balanced steady states: unifying and generalizing complex and detailed balanced steady states
• Integral bases and \(p\)-twisted digraphs
• The feasible regions for consecutive patterns of pattern-avoiding permutations
• Enumerating \(k\)-arc-connected orientations
• Minimum path bases and relevant paths
• scientific article; zbMATH DE number 475590 (Why is no real title available?)
• A Family of Tree-Based Generators for Bubbles in Directed Graphs
• A family of tree-based generators for bubbles in directed graphs
• The feasible region for consecutive patterns of permutations is a cycle polytope
• The feasible region for consecutive patterns of permutations is a cycle polytope
• On bubble generators in directed graphs
• Forward and line-based cycle bases for periodic timetabling
• Computing cyclic invariants for molecular graphs

This page was built for publication: Circuit bases of strongly connected digraphs

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