ScholarLens Back to search
2013•Unpublished venueRequires access

Counting the Number of Vertex Covers With Minimum / Maximum Weight in a Weighted Interval Graph

Yung-Jui Chen

Open publisher page 0 citations

Abstract

This study provides O(n) algorithms to count the number of minimum/maximum weighted vertex covers in a weighted interval graph.

About this research paper

What this paper is about

This study provides O(n) algorithms to count the number of minimum/maximum weighted vertex covers in a weighted interval graph.

Why it matters

A significance statement is not available in the OpenAlex record.

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.

Available abstract

This study provides O(n) algorithms to count the number of minimum/maximum weighted vertex covers in a weighted interval graph.

Key concepts: Mathematics, Combinatorics, Vertex (graph theory), Graph, Interval graph, Interval (graph theory), Minimum weight, Discrete mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Counting the Number of Vertex Covers With Minimum / Maximum Weight in a Weighted Interval Graph — Research Paper | ScholarLens