scientific article
From MaRDI portal
Publication:3821582
zbMath0668.68050MaRDI QIDQ3821582
Publication date: 1988
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 (18)
On Planar Boolean CSP ⋮ Positive planar satisfiability problems under 3-connectivity constraints ⋮ On strongly planar not-all-equal 3SAT ⋮ On planar valued CSPs ⋮ Colorful edge decomposition of graphs: some polynomial cases ⋮ Algorithmic complexity of proper labeling problems ⋮ \(st\)-orientations with few transitive edges ⋮ Relating planar graph drawings to planar satisfiability problems ⋮ $st$-Orientations with Few Transitive Edges ⋮ Simultaneous Orthogonal Planarity ⋮ Polychromatic colorings of plane graphs ⋮ Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect ⋮ On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications ⋮ Computing k-modal embeddings of planar digraphs ⋮ Subexponential algorithms for variants of the homomorphism problem in string graphs ⋮ NodeTrix planarity testing with small clusters ⋮ Planar 3-SAT with a clause/variable cycle
This page was built for publication:
