Linear-time recognition of bipartite graphs plus two edges
From MaRDI portal
Publication:1868840
DOI10.1016/S0012-365X(02)00493-4zbMath1012.05146OpenAlexW2016921924MaRDI QIDQ1868840
Publication date: 28 April 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00493-4
graph algorithmlinear-time algorithmparametric complexitydepth first searchmax cutrecognizing graph properties
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Algorithms in computer science (68W99)
Related Items (1)
This page was built for publication: Linear-time recognition of bipartite graphs plus two edges