✦ LIBER ✦

A Simple Linear Time LexBFS Cograph Recognition Algorithm

✍ Scribed by Bretscher, Anna; Corneil, Derek; Habib, Michel; Paul, Christophe

Book ID: 118196956
Publisher: Society for Industrial and Applied Mathematics
Year: 2008
Tongue: English
Weight: 250 KB
Volume: 22
Category: Article
ISSN: 0895-4801
DOI: 10.1137/060664690

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm for the maximum

A linear time algorithm for the maximum matching problem on cographs

✍ Ming-Shing Yu; Cheng-Hsing Yang 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 497 KB

A Simple Linear-Time Recognition Algorit

A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs

✍ Stavros D. Nikolopoulos; Charis Papadopoulos 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 206 KB

A simple linear-time algorithm for the r

A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs

✍ Fillia Makedon; Dafna Sheinwald; Yaron Wolfsthal 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 382 KB

A linear-time recognition algorithm for

A linear-time recognition algorithm for interval dags

✍ Harold N. Gabow 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 412 KB

A linear-time algorithm for the k-fixed-

A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs

✍ Katerina Asdre; Stavros D. Nikolopoulos 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB 👁 1 views

A fully dynamic algorithm for modular de

A fully dynamic algorithm for modular decomposition and recognition of cographs

✍ Ron Shamir; Roded Sharan 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 236 KB

The problem of dynamically recognizing a graph property calls for e ciently deciding if an input graph satisÿes the property under repeated modiÿcations to its set of vertices and edges. The input to the problem consists of a series of modiÿcations to be performed on the graph. The objective is to m