scientific article; zbMATH DE number 1753166
From MaRDI portal
Publication:4533374
zbMath0994.68098MaRDI QIDQ4533374
Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
Publication date: 26 September 2002
Full work available at URL: https://eudml.org/doc/122068
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs ⋮ Simple DFS on the complement of a graph and on partially complemented digraphs ⋮ On the parallel computation of the biconnected and strongly connected co-components of graphs ⋮ Speeding up Graph Algorithms via Switching Classes ⋮ A general label search to investigate classical graph search algorithms ⋮ Linear-time modular decomposition of directed graphs ⋮ On the Power of Graph Searching for Cocomparability Graphs ⋮ On the Strongly Connected and Biconnected Components of the Complement of Graphs
