Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions
type: Item
instance of: scholarly article
title: Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions
zbMATH Open document ID: 1451.05232
author: Lena Schlipf
author: Jens M. Schmidt
published in: Information Processing Letters
publication date: 2019-03-11T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 7033890
zbMATH Keywords: \textit{st}-numberings
zbMATH Keywords: \textit{st}-edge-numberings
zbMATH Keywords: ear decompositions
zbMATH Keywords: linear time
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2019.01.008
OpenAlex ID: W2912245476
Wikidata QID: Q61772238
cites work: Output-sensitive reporting of disjoint paths
cites work: Q4411355
cites work: Q4411363
cites work: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
cites work: st-ordering the vertices of biconnected graphs
cites work: Computing an st-numbering
cites work: Parallel ear decomposition search (EDS) and st-numbering in graphs
cites work: Algorithms for computing a parameterized \(st\)-orientation
cites work: Q5111406
cites work: A simple test on 2-vertex- and 2-edge-connectivity
cites work: Mondshein sequences (a.k.a. (2,1)-orders)
cites work: Q3719851
cites work: Maintaining order in a generalized linked list
DBLP publication ID: journals/ipl/SchlipfS19
DOI: 10.1016/J.IPL.2019.01.008
description: scientific article; zbMATH DE number 7033890