scientific article
From MaRDI portal
Publication:3042417
zbMath0527.68049MaRDI QIDQ3042417
Andrzej Proskurowski, Stefan Arnborg
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
independent setHamiltonian circuitdominating setchordal graphsseries-parallel graphsvertex covernetwork reliabilitylinear time algorithmsk-treeNP-hard problems on graphsgraph K-colorability
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (13)
A recurrence template for several parameters in series-parallel graphs ⋮ Steiner problem in Halin networks ⋮ MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS ⋮ Algebraic approach to fasciagraphs and rotagraphs ⋮ NC-algorithms for graphs with small treewidth ⋮ Forbidden minors characterization of partial 3-trees ⋮ Steiner problem in networks: A survey ⋮ On two dual classes of planar graphs ⋮ Algorithms for recognition of regular properties and decomposition of recursive graph families ⋮ LP Formulations for Polynomial Optimization Problems ⋮ Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families ⋮ Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey ⋮ New limits of treewidth-based tractability in optimization
This page was built for publication:
