Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage (Q2839217): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4508365 / 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: A linear-time algorithm for a special case of disjoint set union / 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: A recognition algorithm for the intersection graphs of directed paths in directed trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Solution for the Channel-Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The leafage of a chordal graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing triangulated graphs in stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm to recognize undirected path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank

Latest revision as of 14:16, 6 July 2024

scientific article
Language Label Description Also known as
English
Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage
scientific article

    Statements

    Identifiers