The PIGs Full Monty – A Floor Show of Minimal Separators-Reference-Cited by-同舟云学术

The PIGs Full Monty – A Floor Show of Minimal Separators

Published:2005 Issue: Volume: Page:521-532
ISSN:0302-9743
Container-title:STACS 2005
language:
Short-container-title:

Author:

Chang Gerard Jennhwa,Kloks Antonius J. J.,Liu Jiping,Peng Sheng-Lung

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-31856-9_43.pdf

Reference20 articles.

1. Berry, A., Golumbic, M.C., Lipshteyn, M.: Recognizing and triangulating chordal probe graphs. Research Report LIMOS/RR–03–08, July 4 (2003)

2. Berry, A., Golumbic, M.C., Lipshteyn, M.: Two tricks to triangulate chordal probe graphs in polynomial time. In: Proceedings 15th ACM–SIAM Symposium on Discrete Algorithms, pp. 962–969 (2004)

3. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ–tree algorithms. Journal of Computer and System Sciences 13, 335–379 (1976)

4. Lecture Notes in Computer Science;V. Bouchitté,1999

5. Brändstadt, A., Le, V., Spinrad, J.P.: Graph classes: A survey. In: SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (1999)

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

1. Recognition of Probe Ptolemaic Graphs;Lecture Notes in Computer Science;2011

2. Linear-Time Recognition of Probe Interval Graphs;Lecture Notes in Computer Science;2009

3. Characterisations and Linear-Time Recognition of Probe Cographs;Graph-Theoretic Concepts in Computer Science;2007

4. On Probe Permutation Graphs;Lecture Notes in Computer Science;2006

5. Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs;Algorithmic Aspects in Information and Management;2006