Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions

DOI10.1016/j.ipl.2019.01.008zbMath1451.05232WikidataQ61772238 ScholiaQ61772238MaRDI QIDQ1730030

Jens M. Schmidt, Lena Schlipf

Publication date: 11 March 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2019.01.008

zbMATH Keywords

graph algorithms; linear time; ear decompositions; \textit{st}-edge-numberings; \textit{st}-numberings

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C30: Enumeration in graph theory

05C85: Graph algorithms (graph-theoretic aspects)

68P05: Data structures