New graph decompositions with applications to emulations (Q675853): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Near-Linear Time Construction of Sparse Neighborhood Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Rearrangeable Multistage Connecting Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-scale self-simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Partitioning Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded minors, network decomposition, and multicommodity flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Work-preserving emulations of fixed-connection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of universal parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Simulations among Several Models of Parallel Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality considerations in VLSI circuits / rank
 
Normal rank

Latest revision as of 10:44, 27 May 2024

scientific article
Language Label Description Also known as
English
New graph decompositions with applications to emulations
scientific article

    Statements

    Identifiers