Edge-orders

DOI10.4230/LIPICS.ICALP.2017.75MaRDI QIDQ5111406zbMATH OpenFDO

Authors Lena Schlipf, Jens M. Schmidt

Publication date 27 May 2020

zbMATH Keywords

linear timecanonical orderingedge-independent spanning treeedge-orderMondshein sequencest-edge-order

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Edge-orders
• Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions
• Four edge-independent spanning trees
• Mondshein sequences (a.k.a. (2,1)-orders)
• The Mondshein Sequence

Cited in

(8)

• Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions
• Edges and tableaux
• scientific article; zbMATH DE number 2152675 (Why is no real title available?)
• Mondshein sequences (a.k.a. (2,1)-orders)
• Edge-independent spanning trees in folded crossed cubes
• Four edge-independent spanning trees
• Parallel ordering using edge contraction
• Edge-orders

This page was built for publication: Edge-orders

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