Finding cores of limited length (Q5096925): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding cores of limited length / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Connected with Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating path- or tree-shaped facilities on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4893475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Finding a Core of a Tree with a Specified Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal location of a path or tree in a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding the core of a tree with a specified length / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for a core of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for a Core and k-Tree Core of a Tree / rank
 
Normal rank

Latest revision as of 21:47, 29 July 2024

scientific article; zbMATH DE number 7573275
Language Label Description Also known as
English
Finding cores of limited length
scientific article; zbMATH DE number 7573275

    Statements

    Identifiers

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