2012•Discrete Applied MathematicsOpen access

Approximating the path-distance-width for AT-free graphs and graphs in related classes

Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki

Open full text 1 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 1 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: Indifference graph, Pathwidth, Mathematics, Chordal graph, Combinatorics, Longest path problem, Maximal independent set, Modular decomposition

Back to paper search Browse research topics Original source

Approximating the path-distance-width for AT-free graphs and graphs in related classes — Research Paper | ScholarLens