ScholarLens Back to search
2013•Information Processing LettersRequires access

Computing a minimum outer-connected dominating set for the class of chordal graphs

Julian Keil, D. Pradhan

Open publisher page 18 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 18 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: Chordal graph, Dominating set, Combinatorics, Maximal independent set, Mathematics, Interval graph, Indifference graph, Pathwidth

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Computing a minimum outer-connected dominating set for the class of chordal graphs — Research Paper | ScholarLens