The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (Q2025063): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The firefighter problem with more than one firefighter on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes and Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating labeled planar graphs uniformly at random / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems on \(H\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse chromatic number problems in interval and permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some applications of the selective graph coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small 1-defective Ramsey numbers in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting clique trees and computing perfect elimination schemes in parallel / 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: Parameterized coloring problems on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating interval coloring and max-coloring in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5683627 / 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: Random generation and enumeration of bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Generation of Random Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extracting maximum stable sets in perfect graphs using Lovász's theta function / rank
 
Normal rank

Latest revision as of 19:03, 25 July 2024

scientific article
Language Label Description Also known as
English
The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
scientific article

    Statements

    The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2021
    0 references
    chordal graph
    0 references
    representation complexity
    0 references
    graph generation
    0 references
    subtree intersection
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references