Author:
Habib Michel,Paul Christophe
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference21 articles.
1. A. Bretscher, D.G. Corneil, M. Habib, C. Paul, A simple linear time lexbfs cograph recognition algorithm, in: Graph-Theoretic Concepts in Computer Science - WG'03, number 2880 in Lecture Notes in Computer Science, 2003, pp. 119–130.
2. C. Capelle, Decomposition de graphes et permutations factorisantes, Ph.D. Thesis, Univ. de Montpellier II, 1997.
3. Graph decompositions and factorizing permutations;Capelle;Discrete Math. Theoret. Comput. Sci.,2002
4. A linear recognition algorithm for cographs;Corneil;SIAM J. Comput.,1985
5. A. Cournier, M. Habib, A new linear algorithm for modular decomposition, in: S. Tison (Ed.), 19th International ColloquiumTrees in Algebra and Programming, CAAP'94, Vol. 787, Lecture notes in Computer Science, Springer, Berlin, 1994, pp. 68–82.
Cited by
58 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints;Memoirs of the American Mathematical Society;2024-02
2. A linear algorithm for obtaining the Laplacian eigenvalues of a cograph;Special Matrices;2024-01-01
3. Decomposition of <i>P</i><sub>6</sub>-Free Chordal Bipartite Graphs;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2023-11-01
4. Complexity Results on Cosecure Domination in Graphs;Algorithms and Discrete Applied Mathematics;2023
5. Open distance pattern uniform complement reducible graphs;INTERNATIONAL CONFERENCE ON RECENT ADVANCES IN MATHEMATICS AND COMPUTATIONAL ENGINEERING: ICRAMCE 2022;2023