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