scientific article; zbMATH DE number 6469131

MaRDI QIDQ5501241zbMATH OpenFDO

Authors Harold N. Gabow, Shuxin Nie

Publication date 3 August 2015

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Finding a long directed cycle
• Finding Long Paths, Cycles and Circuits
• scientific article; zbMATH DE number 3937199
• scientific article; zbMATH DE number 1286512
• A randomized algorithm for long directed cycle
• Finding and counting given length cycles
• Extending cycles in directed graphs
• Long cycles through specified vertices in a graph
• Automata, Languages and Programming
• Long paths, long cycles, and their relative length

Cited in

(8)

• Detecting directed 4-cycles still faster
• Approximating the maximum clique minor and some subgraph homeomorphism problems
• A randomized algorithm for long directed cycle
• scientific article; zbMATH DE number 3937199 (Why is no real title available?)
• Determination of a circuit in a directed graph
• Finding a subdivision of a digraph
• Finding a long directed cycle
• Finding and counting given length cycles

This page was built for publication:

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