The clique-separator graph for chordal graphs (Q1026133): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2009.02.006 / 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.2009.02.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964882757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power of Natural Semijoins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval 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: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval 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: A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: an ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tree representation of chordal 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 / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of chordal graphs as subtrees of a tree / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2009.02.006 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:35, 10 December 2024

scientific article
Language Label Description Also known as
English
The clique-separator graph for chordal graphs
scientific article

    Statements

    The clique-separator graph for chordal graphs (English)
    0 references
    0 references
    24 June 2009
    0 references
    chordal graph
    0 references
    clique tree
    0 references
    interval graph
    0 references
    split graph
    0 references

    Identifiers