OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING

DOI10.1142/S1793830914500049zbMath1290.05081OpenAlexW4250445758MaRDI QIDQ5411798

Swadesh Choudhary, Hrishikesh Sharma, Sachin B. Patkar

Publication date: 25 April 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830914500049

zbMATH Keywords

finite projective geometryparallel schedulingsemi-parallel architecturevector space partitioning

Mathematics Subject Classification ID

Algebraic field extensions (12F05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial structures in finite projective spaces (51E20) Computer system organization (68M99) Directed graphs (digraphs), tournaments (05C20) Vector spaces, linear dependence, rank, lineability (15A03) Field arithmetic (12E30)

Cites Work

• Partitions of a vector space
• Low-density parity-check codes based on finite geometries: a rediscovery and new results

This page was built for publication: OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING