A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs (Q5941505): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127220169, #quickstatements; #temporary_batch_1722371031483
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / 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: 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: Completely separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127220169 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:43, 30 July 2024

scientific article; zbMATH DE number 1635698
Language Label Description Also known as
English
A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
scientific article; zbMATH DE number 1635698

    Statements