On Cutwidth Parameterized by Vertex Cover

Algorithmica - United States
doi 10.1007/s00453-012-9707-6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Parameterized Complexity of Generalized Vertex Cover Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Properties of Vertex Cover Obstructions

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2007English

Approximation of Partial Capacitated Vertex Cover

SIAM Journal on Discrete Mathematics
Mathematics
2010English

Revisiting the Vertex Cover of Graphs

Applied Mathematical Sciences
2015English

Improved Upper Bounds for Partial Vertex Cover

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Efficiently Counting Vertex Orbits of All 5-Vertex Subgraphs, by EVOKE

2020English

Noisy Sparse Recovery Based on Parameterized Quadratic Programming by Thresholding

Eurasip Journal on Advances in Signal Processing
HardwareElectronic EngineeringSignal ProcessingElectricalArchitecture
2011English

Crown Reductions for the Minimum Weighted Vertex Cover Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

Extension and Its Price for the Connected Vertex Cover Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy