Parameterized Minimum Cost Partition of a Tree with Supply and Demand (Q3452563): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-19647-3_17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1173592654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning models for parallel computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARTITIONING TREES OF SUPPLY AND DEMAND / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of partitioning graphs with supply and demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning graphs of supply and demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost partitions of trees with supply and demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: VLSI Physical Design: From Graph Partitioning to Timing Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric power supply networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree \(t\)-spanners in outerplanar graphs via supply demand partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling the Power Supply Network – Hardness and Approximation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:19, 11 July 2024

scientific article
Language Label Description Also known as
English
Parameterized Minimum Cost Partition of a Tree with Supply and Demand
scientific article

    Statements

    Identifiers

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