A simple linear time algorithm for cograph recognition (Q1764804): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2004.01.011 / rank
Normal rank
 
Property / author
 
Property / author: Michel A. Habib / rank
Normal rank
 
Property / author
 
Property / author: Michel A. Habib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2004.01.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2171760878 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56475004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel recognition algorithms of cographs and distance hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Practical Algorithms for Sequential Modular Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Brittle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree representation for \(P_ 4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dam/HabibP05 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2004.01.011 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:32, 11 December 2024

scientific article
Language Label Description Also known as
English
A simple linear time algorithm for cograph recognition
scientific article

    Statements

    A simple linear time algorithm for cograph recognition (English)
    0 references
    0 references
    0 references
    22 February 2005
    0 references
    Modular decomposition
    0 references
    Graphs
    0 references
    Algorithms
    0 references

    Identifiers