Approximation and Kernelization for Chordal Vertex Deletion

doi 10.1137/1.9781611974782.91
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Approximation Algorithms Inspired by Kernelization Methods

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Approximation of Partial Capacitated Vertex Cover

SIAM Journal on Discrete Mathematics
Mathematics
2010English

Dynamical Vertex Approximation for the Two-Dimensional Hubbard Model

Journal of Magnetism and Magnetic Materials
OpticalElectronicCondensed Matter PhysicsMagnetic Materials
2016English

Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme

2019English

Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2002English

Distance Approximating Trees for Chordal and Dually Chordal Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Np-Completeness and Approximation Algorithm for the Maximum Integral Vertex-Balanced Flow Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1991English

Average Parameterization and Partial Kernelization for Computing Medians

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

A Problem Kernelization for Graph Packing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy