One-phase algorithm for the determination of minimal vertex separators of chordal graphs (Q3002552): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A linear time algorithm to list the minimal separators of 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: 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: Counting clique trees and computing perfect elimination schemes in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal vertex separators of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subclasses of \(k\)-trees: characterization and recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel recognition algorithms for chordal-planar graphs and planar \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple characterizations of k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of homeomorphic subgraphs in chordal graphs / rank
 
Normal rank

Latest revision as of 02:42, 4 July 2024

scientific article
Language Label Description Also known as
English
One-phase algorithm for the determination of minimal vertex separators of chordal graphs
scientific article

    Statements

    Identifiers