scientific article; zbMATH DE number 742959
From MaRDI portal
Publication:4763401
zbMath0829.68093MaRDI QIDQ4763401
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan
Publication date: 11 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases ⋮ Efficient algorithms for a mixed k-partition problem of graphs without specifying bases ⋮ Approximating unweighted connectivity problems in parallel ⋮ Linear time algorithms for graph search and connectivity determination on complement graphs.
This page was built for publication: