PARTITIONING TREES OF SUPPLY AND DEMAND (Q5462677): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q226821
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Takao Nishizeki / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of partitioning graphs into connected subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for four-partitioning four-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for large multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-Min Tree Partitioning / rank
 
Normal rank

Latest revision as of 13:35, 10 June 2024

scientific article; zbMATH DE number 2190875
Language Label Description Also known as
English
PARTITIONING TREES OF SUPPLY AND DEMAND
scientific article; zbMATH DE number 2190875

    Statements

    Identifiers