A Simple Linear Time LexBFS Cograph Recognition Algorithm-Reference-Cited by-同舟云学术

A Simple Linear Time LexBFS Cograph Recognition Algorithm

Published:2003 Issue: Volume: Page:119-130
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Bretscher Anna,Corneil Derek,Habib Michel,Paul Christophe

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-39890-5_11

Reference15 articles.

1. Lecture Notes in Computer Science;J.-M. Chang,1999

2. Corneil, D.G.: A Simple 3-sweep LBFS Algorithm for the Recognition of Unit Interval Graphs. Discrete AppliedMathematics (to appear)

3. Corneil, D.G., Olariu, S., Stewart, L.K.: The Ultimate Interval Graph Recognition Algorithm (Extended Abstract). In: Symposium on Discrete Algorithms, pp. 175–180 (1998)

4. Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement Reducible Graphs. Discrete Applied Math. 3(1), 63–174 (1981)

5. Corneil, D.G., Pearl, Y., Stewart, L.: A linear recognition algorithm for cographs. SIAM Journal of Computing 14(4), 926–934 (1985)

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Characterizations, probe and sandwich problems on (k,ℓ)-cographs;Discrete Applied Mathematics;2020-07

2. On some combinatorial problems in cographs;International Journal of Advances in Engineering Sciences and Applied Mathematics;2019-02-25

3. On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs;Graph-Theoretic Concepts in Computer Science;2016

4. Orthology Relation and Gene Tree Correction: Complexity Results;Lecture Notes in Computer Science;2015

5. Characterizing and computing minimal cograph completions;Discrete Applied Mathematics;2010-04