A Linear Time Algorithm for Determining Almost Bipartite Graphs
From MaRDI portal
Publication:2948463
DOI10.1007/978-3-319-17142-5_15zbMath1460.68075OpenAlexW831273921MaRDI QIDQ2948463
Publication date: 30 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17142-5_15
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: A Linear Time Algorithm for Determining Almost Bipartite Graphs
