scientific article; zbMATH DE number 480527
From MaRDI portal
Publication:4274209
zbMath0782.05077MaRDI QIDQ4274209
Publication date: 3 January 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
treescographsNP-completesplit graphsinterval graphsplaneundirected graphsfast approximation algorithmrectilinear gridsconnected configurations
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices, Local search algorithms for the \(k\)-cardinality tree problem.