2008•Lecture notes in computer scienceOpen access

Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs

Andreas Wiese, Evangelos Kranakis

Open full text 4 citations

Abstract

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

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 4 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: Combinatorics, Bounded function, Vertex cover, Vertex (graph theory), Unit disk graph, Matching (statistics), Mathematics, Approximation algorithm

Back to paper search Browse research topics Original source

Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs — Research Paper | ScholarLens