The 3-Steiner Root Problem (Q3508559): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Structure and linear time recognition of 3-leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Tree Root Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Phylogenetic Roots with Bounded Degrees and Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing bounded-degree phylogenetic roots of disconnected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error compensation in leaf power problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / 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: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strictly chordal graphs are leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graph Powers for Leaf-Labeled Trees / rank
 
Normal rank

Latest revision as of 12:58, 28 June 2024

scientific article
Language Label Description Also known as
English
The 3-Steiner Root Problem
scientific article

    Statements

    Identifiers