Two methods for the generation of chordal graphs (Q940844): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithmic aspects in speech recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating and characterizing the perfect elimination orderings of a chordal graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsification—a technique for speeding up dynamic graph algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic algorithms for chordal graphs and split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique tree generalization and new subclasses of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two methods for the generation of chordal 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: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971979 / rank
 
Normal rank

Latest revision as of 15:03, 28 June 2024

scientific article
Language Label Description Also known as
English
Two methods for the generation of chordal graphs
scientific article

    Statements

    Identifiers