Edge-orders

DOI10.4230/LIPICS.ICALP.2017.75zbMATH Open1441.68195MaRDI QIDQ5111406FDOQ5111406

Authors: Lena Schlipf, Jens M. Schmidt 

Publication date: 27 May 2020

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

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)

Cited In (8)

• Parallel ordering using edge contraction
• Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions
• Edge-orders
• Edge-independent spanning trees in folded crossed cubes
• Four edge-independent spanning trees
• Mondshein sequences (a.k.a. (2,1)-orders)
• Edges and tableaux
• Title not available (Why is that?)

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)