scientific article
From MaRDI portal
Publication:3804207
zbMath0656.68070MaRDI QIDQ3804207
Elias Dahlhaus, Marek Karpinski
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)
Related Items (7)
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem ⋮ An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph ⋮ A global parallel algorithm for the hypergraph transversal problem ⋮ On the complexity of monotone dualization and generating minimal hypergraph transversals ⋮ Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search ⋮ The maximum clique problem ⋮ An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs
This page was built for publication:
