Ford-Fulkerson algorithm and short cycles in embedded graphs

MaRDI QIDQ5319630zbMATH OpenFDO

Authors Yan Zhang, Han Ren

Publication date 22 July 2009

zbMATH Keywords

co-cyclecontractible cycleseparating cycletwosided cycle

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Finding shortest contractible and shortest separating cycles in embedded graphs
• Finding shortest contractible and shortest separating cycles in embedded graphs
• Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
• Finding short cycles in embedded graph in polynomial time
• Algorithms – ESA 2005

Cited in

(1)

• Finding short cycles in embedded graph in polynomial time

This page was built for publication: Ford-Fulkerson algorithm and short cycles in embedded graphs

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