### 抜粋

The path-distance-width of a graph measures how close the graph is to a path. We consider the problem of determining the path-distance-width for graphs with chain-like structures such as k-cocomparability graphs, AT-free graphs, and interval graphs. We first show that the problem is NP-hard even for a very restricted subclass of AT-free graphs. Next we present simple approximation algorithms with constant approximation ratios for graphs with chain-like structures. For instance, our algorithm for AT-free graphs has approximation factor 3 and runs in linear time. We also show that the problem is solvable in polynomial time for the class of cochain graphs, which is a subclass of the class of proper interval graphs.

元の言語 | 英語 |
---|---|

ホスト出版物のタイトル | Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Revised Papers |

ページ | 271-282 |

ページ数 | 12 |

DOI | |

出版物ステータス | 出版済み - 12 1 2011 |

イベント | 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011 - Tepla Monastery, チェコ共和国 継続期間: 6 21 2011 → 6 24 2011 |

### 出版物シリーズ

名前 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

巻 | 6986 LNCS |

ISSN（印刷物） | 0302-9743 |

ISSN（電子版） | 1611-3349 |

### その他

その他 | 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011 |
---|---|

国 | チェコ共和国 |

市 | Tepla Monastery |

期間 | 6/21/11 → 6/24/11 |

### フィンガープリント

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### これを引用

*Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Revised Papers*(pp. 271-282). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6986 LNCS). https://doi.org/10.1007/978-3-642-25870-1_25