scientific article
From MaRDI portal
Publication:3787505
zbMath0644.68094MaRDI QIDQ3787505
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items (16)
Heuristic search for the stacking problem ⋮ Tree search for the stacking problem ⋮ Sorting with networks of data structures ⋮ The complexity of colouring circle graphs ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Computing NodeTrix Representations of Clustered Graphs ⋮ Mixed linear layouts: complexity, heuristics, and experiments ⋮ Parameterized domination in circle graphs ⋮ Track assignment ⋮ Approximating the minimum clique cover and other hard problems in subtree filament graphs ⋮ On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering ⋮ Generalised online colouring problems in overlap graphs ⋮ Upward Book Embeddings of st-Graphs ⋮ Maximum Independent Set in 2-Direction Outersegment Graphs ⋮ Beyond Clustered Planar Graphs ⋮ Revising Johnson's table for the 21st century
This page was built for publication:
