2013•Theoretical Computer ScienceOpen access

Solving min ones 2 -sat as fast as vertex cover

Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar

Open full text 10 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Vertex cover, Edge cover, Parameterized complexity, Kernelization, Mathematics, Combinatorics, Vertex (graph theory), Feedback vertex set

Back to paper search Browse research topics Original source

Solving min ones 2 -sat as fast as vertex cover — Research Paper | ScholarLens