arXiv Open Access 2018

Weighted vertex cover on graphs with maximum degree 3

Dekel Tsur

Lihat Sumber

Abstrak

We give a parameterized algorithm for weighted vertex cover on graphs with maximum degree 3 whose time complexity is $O^*(1.402^t)$, where $t$ is the minimum size of a vertex cover of the input graph.

Topik & Kata Kunci

cs.DS

Penulis (1)

Dekel Tsur

Format Sitasi

APA MLA BibTeX

Tsur, D. (2018). Weighted vertex cover on graphs with maximum degree 3. https://arxiv.org/abs/1810.12982

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2018
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓