scientific article
From MaRDI portal
Publication:3318125
zbMath0534.68046MaRDI QIDQ3318125
Publication date: 1983
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) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (14)
Some observations on holographic algorithms ⋮ A lower bound on the acyclic matching number of subcubic graphs ⋮ On line graphs of subcubic triangle-free graphs ⋮ Boundary classes for graph problems involving non-local properties ⋮ Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity ⋮ Feedback vertex set on Hamiltonian graphs ⋮ Feedback vertex set reconfiguration in planar graphs ⋮ On feedback vertex sets and nonseparating independent sets in cubic graphs ⋮ On feedback vertex set: new measure and new structures ⋮ A polyhedral approach to the feedback vertex set problem ⋮ On cycle transversals and their connected variants in the absence of a small linear forest ⋮ Subexponential-time algorithms for finding large induced sparse subgraphs ⋮ A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs ⋮ The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
This page was built for publication:
